YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:27:07,884 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:27:07,886 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:27:07,897 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:27:07,897 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:27:07,898 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:27:07,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:27:07,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:27:07,902 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:27:07,903 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:27:07,903 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:27:07,904 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:27:07,905 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:27:07,905 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:27:07,906 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:27:07,907 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:27:07,908 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:27:07,910 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:27:07,911 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:27:07,913 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:27:07,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:27:07,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:27:07,917 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:27:07,917 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:27:07,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:27:07,918 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:27:07,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:27:07,919 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:27:07,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:27:07,920 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:27:07,921 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:27:07,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:27:07,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:27:07,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:27:07,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:27:07,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:27:07,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:27:07,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:27:07,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:27:07,925 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-06-22 10:27:07,939 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:27:07,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:27:07,940 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:27:07,940 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:27:07,941 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:27:07,941 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:27:07,941 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:27:07,941 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:27:07,941 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:27:07,942 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:27:07,942 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:27:07,942 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:27:07,942 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:27:07,942 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:27:07,942 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:27:07,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:27:07,943 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:27:07,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:27:07,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:27:07,943 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:27:07,943 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:27:07,944 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:27:07,944 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:27:07,944 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:27:07,944 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:27:07,944 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:27:07,944 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:27:07,945 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:27:07,945 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:27:07,970 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:27:07,982 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:27:07,986 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:27:07,987 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:27:07,988 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:27:07,988 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:27:08,049 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/c04a14e48e5a49639e6fa87d6e6ee561/FLAG77f1e1812 [2020-06-22 10:27:08,394 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:27:08,395 INFO L161 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-06-22 10:27:08,395 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:27:08,401 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/c04a14e48e5a49639e6fa87d6e6ee561/FLAG77f1e1812 [2020-06-22 10:27:08,793 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/c04a14e48e5a49639e6fa87d6e6ee561 [2020-06-22 10:27:08,804 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:27:08,806 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:27:08,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:27:08,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:27:08,811 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:27:08,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:27:08" (1/1) ... [2020-06-22 10:27:08,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4839e208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:08, skipping insertion in model container [2020-06-22 10:27:08,815 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:27:08" (1/1) ... [2020-06-22 10:27:08,823 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:27:08,843 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:27:09,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:27:09,023 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:27:09,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:27:09,116 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:27:09,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09 WrapperNode [2020-06-22 10:27:09,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:27:09,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:27:09,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:27:09,118 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:27:09,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:27:09,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:27:09,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:27:09,158 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:27:09,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:27:09,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:27:09,182 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:27:09,182 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:27:09,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (1/1) ... No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:27:09,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:27:09,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:27:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:27:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:27:09,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:27:09,444 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:27:09,445 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2020-06-22 10:27:09,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:27:09 BoogieIcfgContainer [2020-06-22 10:27:09,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:27:09,447 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:27:09,447 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:27:09,449 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:27:09,450 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:27:09" (1/1) ... [2020-06-22 10:27:09,466 INFO L313 BlockEncoder]: Initial Icfg 18 locations, 23 edges [2020-06-22 10:27:09,467 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:27:09,468 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:27:09,468 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:27:09,469 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:27:09,470 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:27:09,471 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:27:09,471 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:27:09,490 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:27:09,512 INFO L200 BlockEncoder]: SBE split 6 edges [2020-06-22 10:27:09,516 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:27:09,518 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:27:09,531 INFO L100 BaseMinimizeStates]: Removed 6 edges and 3 locations by large block encoding [2020-06-22 10:27:09,534 INFO L70 RemoveSinkStates]: Removed 5 edges and 3 locations by removing sink states [2020-06-22 10:27:09,535 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:27:09,536 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:27:09,536 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:27:09,536 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:27:09,537 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges [2020-06-22 10:27:09,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:27:09 BasicIcfg [2020-06-22 10:27:09,537 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:27:09,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:27:09,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:27:09,542 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:27:09,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:27:08" (1/4) ... [2020-06-22 10:27:09,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a92ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:27:09, skipping insertion in model container [2020-06-22 10:27:09,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (2/4) ... [2020-06-22 10:27:09,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a92ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:27:09, skipping insertion in model container [2020-06-22 10:27:09,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:27:09" (3/4) ... [2020-06-22 10:27:09,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a92ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:27:09, skipping insertion in model container [2020-06-22 10:27:09,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:27:09" (4/4) ... [2020-06-22 10:27:09,546 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:27:09,558 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:27:09,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-06-22 10:27:09,582 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-06-22 10:27:09,611 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:27:09,612 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:27:09,612 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:27:09,612 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:27:09,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:27:09,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:27:09,613 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:27:09,613 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:27:09,613 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:27:09,627 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-06-22 10:27:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:27:09,634 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:09,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:09,635 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:09,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:09,641 INFO L82 PathProgramCache]: Analyzing trace with hash 427553221, now seen corresponding path program 1 times [2020-06-22 10:27:09,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:09,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:09,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:09,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:09,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:09,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:27:09,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:27:09,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:27:09,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:27:09,836 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2020-06-22 10:27:09,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:09,931 INFO L93 Difference]: Finished difference Result 25 states and 40 transitions. [2020-06-22 10:27:09,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:27:09,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-06-22 10:27:09,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:09,944 INFO L225 Difference]: With dead ends: 25 [2020-06-22 10:27:09,945 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:27:09,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:27:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:27:09,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2020-06-22 10:27:09,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-06-22 10:27:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 19 transitions. [2020-06-22 10:27:09,984 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 19 transitions. Word has length 7 [2020-06-22 10:27:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:09,985 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 19 transitions. [2020-06-22 10:27:09,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:27:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 19 transitions. [2020-06-22 10:27:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:27:09,986 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:09,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:09,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:09,987 INFO L82 PathProgramCache]: Analyzing trace with hash 427554182, now seen corresponding path program 1 times [2020-06-22 10:27:09,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:09,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:09,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:09,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:09,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:27:10,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:27:10,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:27:10,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:27:10,050 INFO L87 Difference]: Start difference. First operand 12 states and 19 transitions. Second operand 5 states. [2020-06-22 10:27:10,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:10,133 INFO L93 Difference]: Finished difference Result 12 states and 19 transitions. [2020-06-22 10:27:10,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:27:10,133 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 10:27:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:10,134 INFO L225 Difference]: With dead ends: 12 [2020-06-22 10:27:10,134 INFO L226 Difference]: Without dead ends: 11 [2020-06-22 10:27:10,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:27:10,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-06-22 10:27:10,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-06-22 10:27:10,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-06-22 10:27:10,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-06-22 10:27:10,138 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 7 [2020-06-22 10:27:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:10,139 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-06-22 10:27:10,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:27:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-06-22 10:27:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:27:10,139 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:10,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:10,140 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash 427554184, now seen corresponding path program 1 times [2020-06-22 10:27:10,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:10,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:10,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:10,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:27:10,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:27:10,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:27:10,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:27:10,187 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 5 states. [2020-06-22 10:27:10,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:10,254 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2020-06-22 10:27:10,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 10:27:10,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2020-06-22 10:27:10,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:10,257 INFO L225 Difference]: With dead ends: 16 [2020-06-22 10:27:10,257 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 10:27:10,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-06-22 10:27:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 10:27:10,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-06-22 10:27:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:27:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-06-22 10:27:10,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 20 transitions. Word has length 7 [2020-06-22 10:27:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:10,263 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-06-22 10:27:10,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:27:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 20 transitions. [2020-06-22 10:27:10,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-06-22 10:27:10,264 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:10,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:10,264 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:10,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:10,265 INFO L82 PathProgramCache]: Analyzing trace with hash 427554185, now seen corresponding path program 1 times [2020-06-22 10:27:10,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:10,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:10,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:10,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:10,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:10,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-06-22 10:27:10,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-06-22 10:27:10,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-06-22 10:27:10,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:27:10,347 INFO L87 Difference]: Start difference. First operand 13 states and 20 transitions. Second operand 6 states. [2020-06-22 10:27:10,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:10,462 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2020-06-22 10:27:10,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 10:27:10,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-06-22 10:27:10,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:10,464 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:27:10,464 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 10:27:10,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-06-22 10:27:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 10:27:10,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-06-22 10:27:10,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:27:10,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-06-22 10:27:10,468 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 19 transitions. Word has length 7 [2020-06-22 10:27:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:10,468 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-06-22 10:27:10,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-06-22 10:27:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-06-22 10:27:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:27:10,469 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:10,469 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:10,469 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 2012563625, now seen corresponding path program 1 times [2020-06-22 10:27:10,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:10,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:10,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:10,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:27:10,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:27:10,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 10:27:10,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:10,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:27:10,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 7 [2020-06-22 10:27:10,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 10:27:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 10:27:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-06-22 10:27:10,637 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 8 states. [2020-06-22 10:27:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:10,792 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2020-06-22 10:27:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:27:10,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-06-22 10:27:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:10,793 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:27:10,793 INFO L226 Difference]: Without dead ends: 14 [2020-06-22 10:27:10,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-06-22 10:27:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-06-22 10:27:10,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-06-22 10:27:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-06-22 10:27:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-06-22 10:27:10,799 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 18 transitions. Word has length 12 [2020-06-22 10:27:10,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:10,799 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-06-22 10:27:10,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 10:27:10,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-06-22 10:27:10,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:27:10,800 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:10,800 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:10,800 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:10,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2012563626, now seen corresponding path program 1 times [2020-06-22 10:27:10,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:10,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:10,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:10,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:10,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:27:10,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:27:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:10,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 28 conjunts are in the unsatisfiable core [2020-06-22 10:27:10,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:10,999 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:27:11,000 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:11,007 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:11,007 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:11,008 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 10:27:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:11,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:27:11,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 14 [2020-06-22 10:27:11,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-06-22 10:27:11,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-06-22 10:27:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-06-22 10:27:11,142 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 15 states. [2020-06-22 10:27:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:11,382 INFO L93 Difference]: Finished difference Result 21 states and 29 transitions. [2020-06-22 10:27:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-06-22 10:27:11,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 12 [2020-06-22 10:27:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:11,383 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:27:11,383 INFO L226 Difference]: Without dead ends: 20 [2020-06-22 10:27:11,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2020-06-22 10:27:11,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-06-22 10:27:11,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-06-22 10:27:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:27:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2020-06-22 10:27:11,388 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 12 [2020-06-22 10:27:11,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:11,389 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2020-06-22 10:27:11,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-06-22 10:27:11,389 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2020-06-22 10:27:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-06-22 10:27:11,389 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:11,390 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:11,390 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:11,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:11,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2012564587, now seen corresponding path program 1 times [2020-06-22 10:27:11,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:11,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:11,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:11,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:11,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:11,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:27:11,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 10:27:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:27:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:27:11,419 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 4 states. [2020-06-22 10:27:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:11,448 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2020-06-22 10:27:11,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:27:11,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-06-22 10:27:11,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:11,450 INFO L225 Difference]: With dead ends: 24 [2020-06-22 10:27:11,450 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 10:27:11,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:27:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 10:27:11,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 10:27:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:27:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-06-22 10:27:11,454 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 12 [2020-06-22 10:27:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:11,454 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-06-22 10:27:11,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 10:27:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-06-22 10:27:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 10:27:11,455 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:11,455 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:11,455 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash 396870185, now seen corresponding path program 2 times [2020-06-22 10:27:11,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:11,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:11,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:11,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:11,570 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-06-22 10:27:11,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:27:11,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:27:11,600 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2020-06-22 10:27:11,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-06-22 10:27:11,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-06-22 10:27:11,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 35 conjunts are in the unsatisfiable core [2020-06-22 10:27:11,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:11,643 INFO L374 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-06-22 10:27:11,643 INFO L427 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-06-22 10:27:11,649 INFO L497 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-06-22 10:27:11,650 INFO L427 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-06-22 10:27:11,650 INFO L217 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2020-06-22 10:27:11,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:11,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:27:11,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2020-06-22 10:27:11,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-06-22 10:27:11,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-06-22 10:27:11,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-06-22 10:27:11,803 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 18 states. [2020-06-22 10:27:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:12,294 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2020-06-22 10:27:12,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-06-22 10:27:12,294 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2020-06-22 10:27:12,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:12,295 INFO L225 Difference]: With dead ends: 28 [2020-06-22 10:27:12,295 INFO L226 Difference]: Without dead ends: 27 [2020-06-22 10:27:12,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=905, Unknown=0, NotChecked=0, Total=1122 [2020-06-22 10:27:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-06-22 10:27:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2020-06-22 10:27:12,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 10:27:12,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-06-22 10:27:12,300 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 17 [2020-06-22 10:27:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:12,301 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-06-22 10:27:12,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-06-22 10:27:12,301 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2020-06-22 10:27:12,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-06-22 10:27:12,301 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:27:12,301 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 10:27:12,302 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION]=== [2020-06-22 10:27:12,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:12,302 INFO L82 PathProgramCache]: Analyzing trace with hash 396871146, now seen corresponding path program 1 times [2020-06-22 10:27:12,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:12,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:27:12,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:12,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 10:27:12,344 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 10:27:12,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:12,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2020-06-22 10:27:12,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:12,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 10:27:12,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-06-22 10:27:12,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 10:27:12,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:27:12,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:27:12,419 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand 5 states. [2020-06-22 10:27:12,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:12,452 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-06-22 10:27:12,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:27:12,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-06-22 10:27:12,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:27:12,454 INFO L225 Difference]: With dead ends: 23 [2020-06-22 10:27:12,454 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:27:12,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-06-22 10:27:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:27:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:27:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:27:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:27:12,455 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-06-22 10:27:12,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:27:12,455 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:12,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 10:27:12,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:27:12,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:27:12,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:27:12,598 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2020-06-22 10:27:12,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:27:12,601 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2020-06-22 10:27:12,601 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:27:12,601 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point L23-2(lines 19 32) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point L12-1(lines 12 13) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point L11-1(lines 11 14) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 11 14) no Hoare annotation was computed. [2020-06-22 10:27:12,602 INFO L448 ceAbstractionStarter]: For program point L8(lines 8 15) no Hoare annotation was computed. [2020-06-22 10:27:12,603 INFO L444 ceAbstractionStarter]: At program point L11-4(lines 11 14) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_cmemchr_~n (select |#length| ULTIMATE.start_cmemchr_~s.base))) (.cse1 (= 1 (select |#valid| ULTIMATE.start_cmemchr_~s.base))) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cmemchr_~p~0.base))) (.cse3 (select |#length| ULTIMATE.start_cmemchr_~p~0.base)) (.cse4 (<= 1 ULTIMATE.start_main_~n~0)) (.cse5 (= 0 ULTIMATE.start_cmemchr_~s.offset)) (.cse6 (<= 1 ULTIMATE.start_cmemchr_~n))) (or (and (= ULTIMATE.start_cmemchr_~p~0.offset 0) .cse0 .cse1 .cse2 (<= ULTIMATE.start_cmemchr_~n .cse3) .cse4 .cse5 .cse6) (and (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start_cmemchr_~p~0.offset ULTIMATE.start_cmemchr_~n) .cse3) (<= 1 ULTIMATE.start_cmemchr_~p~0.offset) .cse4 .cse5) .cse6))) [2020-06-22 10:27:12,603 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:27:12,612 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,613 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,620 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:12,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:27:12 BasicIcfg [2020-06-22 10:27:12,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:27:12,623 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:27:12,624 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:27:12,627 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:27:12,627 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:27:12,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:27:08" (1/5) ... [2020-06-22 10:27:12,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8b6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:27:12, skipping insertion in model container [2020-06-22 10:27:12,628 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:27:12,628 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:27:09" (2/5) ... [2020-06-22 10:27:12,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8b6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:27:12, skipping insertion in model container [2020-06-22 10:27:12,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:27:12,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:27:09" (3/5) ... [2020-06-22 10:27:12,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8b6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:27:12, skipping insertion in model container [2020-06-22 10:27:12,629 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:27:12,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:27:09" (4/5) ... [2020-06-22 10:27:12,630 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d8b6d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:27:12, skipping insertion in model container [2020-06-22 10:27:12,630 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:27:12,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:27:12" (5/5) ... [2020-06-22 10:27:12,631 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:27:12,651 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:27:12,652 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:27:12,652 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:27:12,652 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:27:12,652 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:27:12,652 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:27:12,652 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:27:12,652 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:27:12,652 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:27:12,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 10:27:12,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:27:12,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:27:12,660 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:27:12,664 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:12,664 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:12,665 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:27:12,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-06-22 10:27:12,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-06-22 10:27:12,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:27:12,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:27:12,666 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:12,666 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:12,671 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [93] ULTIMATE.startENTRY-->L23: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 9#L23true [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 4#L23-2true [61] L23-2-->L26-1: Formula: (and (= v_ULTIMATE.start_main_~n~0_4 1) (< v_ULTIMATE.start_main_~n~0_5 1)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_5} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~n~0] 13#L26-1true [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|) 0) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 11#L8true [84] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (> v_ULTIMATE.start_cmemchr_~n_6 0) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 10#L11-4true [2020-06-22 10:27:12,672 INFO L796 eck$LassoCheckResult]: Loop: 10#L11-4true [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 8#L12true [66] L12-->L12-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) 1)) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 6#L12-1true [89] L12-1-->L11-1: Formula: (< (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 3#L11-1true [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0) (= v_ULTIMATE.start_cmemchr_~n_1 .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 14#L11-2true [91] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 10#L11-4true [2020-06-22 10:27:12,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash 116752594, now seen corresponding path program 1 times [2020-06-22 10:27:12,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:12,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:12,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash 77782408, now seen corresponding path program 1 times [2020-06-22 10:27:12,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:12,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:12,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash -540919977, now seen corresponding path program 1 times [2020-06-22 10:27:12,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:12,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:12,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:12,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:12,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:12,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 10:27:12,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 10:27:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 10:27:12,797 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 5 states. [2020-06-22 10:27:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:12,897 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2020-06-22 10:27:12,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 10:27:12,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 44 transitions. [2020-06-22 10:27:12,901 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-06-22 10:27:12,902 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 32 transitions. [2020-06-22 10:27:12,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2020-06-22 10:27:12,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2020-06-22 10:27:12,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2020-06-22 10:27:12,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:27:12,905 INFO L706 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2020-06-22 10:27:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2020-06-22 10:27:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2020-06-22 10:27:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:27:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-06-22 10:27:12,908 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 10:27:12,908 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-06-22 10:27:12,908 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:27:12,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2020-06-22 10:27:12,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 10:27:12,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:27:12,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:27:12,909 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:12,909 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:12,910 INFO L794 eck$LassoCheckResult]: Stem: 64#ULTIMATE.startENTRY [93] ULTIMATE.startENTRY-->L23: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 65#L23 [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 61#L23-2 [74] L23-2-->L26-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 62#L26-1 [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|) 0) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 70#L8 [83] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (< v_ULTIMATE.start_cmemchr_~n_6 0) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 68#L11-4 [2020-06-22 10:27:12,910 INFO L796 eck$LassoCheckResult]: Loop: 68#L11-4 [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 67#L12 [66] L12-->L12-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) 1)) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 66#L12-1 [89] L12-1-->L11-1: Formula: (< (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 59#L11-1 [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0) (= v_ULTIMATE.start_cmemchr_~n_1 .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 60#L11-2 [92] L11-2-->L11-4: Formula: (> 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 68#L11-4 [2020-06-22 10:27:12,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash 116765086, now seen corresponding path program 1 times [2020-06-22 10:27:12,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:12,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:12,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:12,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:27:12,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 10:27:12,941 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-06-22 10:27:12,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:12,941 INFO L82 PathProgramCache]: Analyzing trace with hash 77782409, now seen corresponding path program 1 times [2020-06-22 10:27:12,941 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:12,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:12,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 10:27:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 10:27:13,000 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-06-22 10:27:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:27:13,028 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2020-06-22 10:27:13,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 10:27:13,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2020-06-22 10:27:13,030 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 10:27:13,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 34 transitions. [2020-06-22 10:27:13,030 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 10:27:13,031 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2020-06-22 10:27:13,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-06-22 10:27:13,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:27:13,031 INFO L706 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-06-22 10:27:13,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-06-22 10:27:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2020-06-22 10:27:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 10:27:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2020-06-22 10:27:13,033 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 10:27:13,033 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2020-06-22 10:27:13,033 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 10:27:13,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2020-06-22 10:27:13,034 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-06-22 10:27:13,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:27:13,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:27:13,035 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:13,035 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-06-22 10:27:13,035 INFO L794 eck$LassoCheckResult]: Stem: 115#ULTIMATE.startENTRY [93] ULTIMATE.startENTRY-->L23: Formula: (and (= (store |v_#valid_10| 0 0) |v_#valid_9|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~ret7.base=|v_ULTIMATE.start_main_#t~ret7.base_4|, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_3, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_6|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_6|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_6|, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_5, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_8, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_3, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~ret7.offset=|v_ULTIMATE.start_main_#t~ret7.offset_4|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_5|, #valid=|v_#valid_9|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ret7.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~c~0, ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~nondetArea~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_#t~ret7.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_main_~length~0] 116#L23 [73] L23-->L23-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 112#L23-2 [74] L23-2-->L26-1: Formula: (>= v_ULTIMATE.start_main_~n~0_6 1) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} OutVars{ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_6} AuxVars[] AssignedVars[] 113#L26-1 [82] L26-1-->L8: Formula: (and (= v_ULTIMATE.start_main_~nondetArea~0.offset_2 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= v_ULTIMATE.start_cmemchr_~s.base_1 |v_ULTIMATE.start_cmemchr_#in~s.base_1|) (= |v_ULTIMATE.start_cmemchr_#in~c_1| v_ULTIMATE.start_main_~c~0_4) (= v_ULTIMATE.start_cmemchr_~n_4 |v_ULTIMATE.start_cmemchr_#in~n_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= |v_ULTIMATE.start_cmemchr_#in~s.base_1| v_ULTIMATE.start_main_~nondetArea~0.base_2) (= |v_#length_1| (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc6.base_4| v_ULTIMATE.start_main_~n~0_7)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4|) 0) (= |v_ULTIMATE.start_cmemchr_#in~s.offset_1| v_ULTIMATE.start_main_~nondetArea~0.offset_2) (< |v_ULTIMATE.start_main_#t~malloc6.base_4| |v_#StackHeapBarrier_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_4|) (= |v_ULTIMATE.start_cmemchr_#in~n_1| v_ULTIMATE.start_main_~n~0_7) (= v_ULTIMATE.start_cmemchr_~s.offset_1 |v_ULTIMATE.start_cmemchr_#in~s.offset_1|) (= (store |v_#valid_6| |v_ULTIMATE.start_main_#t~malloc6.base_4| 1) |v_#valid_5|) (= v_ULTIMATE.start_main_~nondetArea~0.base_2 |v_ULTIMATE.start_main_#t~malloc6.base_4|) (= v_ULTIMATE.start_cmemchr_~c_1 |v_ULTIMATE.start_cmemchr_#in~c_1|)) InVars {ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_1, ULTIMATE.start_main_~nondetArea~0.offset=v_ULTIMATE.start_main_~nondetArea~0.offset_2, ULTIMATE.start_main_~nondetArea~0.base=v_ULTIMATE.start_main_~nondetArea~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_1, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_4, ULTIMATE.start_cmemchr_#in~s.offset=|v_ULTIMATE.start_cmemchr_#in~s.offset_1|, ULTIMATE.start_cmemchr_#res.base=|v_ULTIMATE.start_cmemchr_#res.base_3|, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_4|, ULTIMATE.start_cmemchr_#in~n=|v_ULTIMATE.start_cmemchr_#in~n_1|, #length=|v_#length_1|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_1|, ULTIMATE.start_cmemchr_#res.offset=|v_ULTIMATE.start_cmemchr_#res.offset_3|, ULTIMATE.start_cmemchr_#in~c=|v_ULTIMATE.start_cmemchr_#in~c_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_4|, ULTIMATE.start_cmemchr_#in~s.base=|v_ULTIMATE.start_cmemchr_#in~s.base_1|, ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_6|, ULTIMATE.start_main_~n~0=v_ULTIMATE.start_main_~n~0_7, ULTIMATE.start_main_~c~0=v_ULTIMATE.start_main_~c~0_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_1|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_1|, ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_1, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_1, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~s.base, ULTIMATE.start_main_~nondetArea~0.offset, ULTIMATE.start_cmemchr_#in~c, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_cmemchr_#in~s.base, ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_main_~nondetArea~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_~n, ULTIMATE.start_cmemchr_#in~s.offset, ULTIMATE.start_cmemchr_#t~post1.base, ULTIMATE.start_cmemchr_~c, ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_#res.base, ULTIMATE.start_cmemchr_~s.offset, ULTIMATE.start_main_#t~malloc6.offset, #valid, ULTIMATE.start_cmemchr_#in~n, #length, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#res.offset] 120#L8 [84] L8-->L11-4: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_2 v_ULTIMATE.start_cmemchr_~s.base_3) (> v_ULTIMATE.start_cmemchr_~n_6 0) (= v_ULTIMATE.start_cmemchr_~p~0.offset_2 v_ULTIMATE.start_cmemchr_~s.offset_3)) InVars {ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} OutVars{ULTIMATE.start_cmemchr_~s.base=v_ULTIMATE.start_cmemchr_~s.base_3, ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_2, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_2, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_6, ULTIMATE.start_cmemchr_~s.offset=v_ULTIMATE.start_cmemchr_~s.offset_3} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset] 119#L11-4 [2020-06-22 10:27:13,036 INFO L796 eck$LassoCheckResult]: Loop: 119#L11-4 [51] L11-4-->L12: Formula: (and (= v_ULTIMATE.start_cmemchr_~p~0.base_3 |v_ULTIMATE.start_cmemchr_#t~post1.base_2|) (= |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| v_ULTIMATE.start_cmemchr_~p~0.offset_4) (= v_ULTIMATE.start_cmemchr_~p~0.offset_3 (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_2| 1)) (= |v_ULTIMATE.start_cmemchr_#t~post1.base_2| v_ULTIMATE.start_cmemchr_~p~0.base_4)) InVars {ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_4, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_4} OutVars{ULTIMATE.start_cmemchr_~p~0.base=v_ULTIMATE.start_cmemchr_~p~0.base_3, ULTIMATE.start_cmemchr_~p~0.offset=v_ULTIMATE.start_cmemchr_~p~0.offset_3, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_2|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_2|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_~p~0.base, ULTIMATE.start_cmemchr_~p~0.offset, ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~post1.base] 118#L12 [66] L12-->L12-1: Formula: (and (= (select (select |v_#memory_int_1| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) |v_ULTIMATE.start_cmemchr_#t~mem2_2|) (<= 0 |v_ULTIMATE.start_cmemchr_#t~post1.offset_3|) (<= (+ |v_ULTIMATE.start_cmemchr_#t~post1.offset_3| 1) (select |v_#length_3| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_cmemchr_#t~post1.base_3|) 1)) InVars {#memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, #length=|v_#length_3|, #valid=|v_#valid_7|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} OutVars{#valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_3|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_2|, #length=|v_#length_3|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~mem2] 117#L12-1 [89] L12-1-->L11-1: Formula: (< (mod |v_ULTIMATE.start_cmemchr_#t~mem2_6| 256) (mod v_ULTIMATE.start_cmemchr_~c_4 256)) InVars {ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_6|} OutVars{ULTIMATE.start_cmemchr_~c=v_ULTIMATE.start_cmemchr_~c_4, ULTIMATE.start_cmemchr_#t~post1.offset=|v_ULTIMATE.start_cmemchr_#t~post1.offset_6|, ULTIMATE.start_cmemchr_#t~mem2=|v_ULTIMATE.start_cmemchr_#t~mem2_5|, ULTIMATE.start_cmemchr_#t~post1.base=|v_ULTIMATE.start_cmemchr_#t~post1.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~post1.offset, ULTIMATE.start_cmemchr_#t~mem2, ULTIMATE.start_cmemchr_#t~post1.base] 110#L11-1 [60] L11-1-->L11-2: Formula: (let ((.cse0 (+ v_ULTIMATE.start_cmemchr_~n_2 (- 1)))) (and (= |v_ULTIMATE.start_cmemchr_#t~pre0_1| .cse0) (= v_ULTIMATE.start_cmemchr_~n_1 .cse0))) InVars {ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_2} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_1|, ULTIMATE.start_cmemchr_~n=v_ULTIMATE.start_cmemchr_~n_1} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0, ULTIMATE.start_cmemchr_~n] 111#L11-2 [91] L11-2-->L11-4: Formula: (< 0 |v_ULTIMATE.start_cmemchr_#t~pre0_5|) InVars {ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_5|} OutVars{ULTIMATE.start_cmemchr_#t~pre0=|v_ULTIMATE.start_cmemchr_#t~pre0_4|} AuxVars[] AssignedVars[ULTIMATE.start_cmemchr_#t~pre0] 119#L11-4 [2020-06-22 10:27:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash 116765087, now seen corresponding path program 1 times [2020-06-22 10:27:13,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:13,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:13,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:13,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:13,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:13,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash 77782408, now seen corresponding path program 2 times [2020-06-22 10:27:13,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:13,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:13,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:27:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash 640777898, now seen corresponding path program 1 times [2020-06-22 10:27:13,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:27:13,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:27:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:13,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 10:27:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:27:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:27:13,268 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2020-06-22 10:27:13,336 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:27:13,337 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:27:13,337 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:27:13,337 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:27:13,338 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:27:13,338 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:27:13,338 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:27:13,338 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:27:13,338 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration3_Lasso [2020-06-22 10:27:13,338 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:27:13,338 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:27:13,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,498 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-06-22 10:27:13,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:27:13,926 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:27:13,932 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:27:13,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:13,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:13,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:13,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:13,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:13,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:13,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:13,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:13,940 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:13,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:13,941 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:13,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:27:13,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:13,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:13,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:13,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:27:13,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:27:13,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:13,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:13,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:13,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:13,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:13,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:13,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:13,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:13,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:13,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:13,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:13,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:13,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:13,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:13,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:13,965 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:13,972 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:13,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:13,973 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:13,973 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:13,973 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:13,973 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:13,976 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:13,976 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:13,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:27:13,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:27:13,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:27:13,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:27:13,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:27:13,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:27:13,991 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:27:13,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:27:14,025 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:27:14,049 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-06-22 10:27:14,050 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2020-06-22 10:27:14,052 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:27:14,053 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:27:14,053 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:27:14,054 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cmemchr_~p~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1) = -1*ULTIMATE.start_cmemchr_~p~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc6.base)_1 Supporting invariants [] [2020-06-22 10:27:14,063 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:27:14,066 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:27:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:14,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 10 conjunts are in the unsatisfiable core [2020-06-22 10:27:14,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:14,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:27:14,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:14,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:27:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:27:14,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 11 conjunts are in the unsatisfiable core [2020-06-22 10:27:14,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:27:14,270 INFO L98 LoopCannibalizer]: 8 predicates before loop cannibalization 8 predicates after loop cannibalization [2020-06-22 10:27:14,274 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2020-06-22 10:27:14,275 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-06-22 10:27:14,464 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 17 states and 24 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 29 states and 39 transitions. Complement of second has 8 states. [2020-06-22 10:27:14,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 2 accepting loop states [2020-06-22 10:27:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-06-22 10:27:14,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-06-22 10:27:14,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 5 letters. [2020-06-22 10:27:14,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:14,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 10 letters. Loop has 5 letters. [2020-06-22 10:27:14,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:14,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 5 letters. Loop has 10 letters. [2020-06-22 10:27:14,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:27:14,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2020-06-22 10:27:14,475 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:27:14,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 0 states and 0 transitions. [2020-06-22 10:27:14,476 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:27:14,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:27:14,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:27:14,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:27:14,476 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:14,476 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:14,476 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:27:14,476 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 10:27:14,476 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:27:14,476 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:27:14,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:27:14,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:27:14 BasicIcfg [2020-06-22 10:27:14,482 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:27:14,483 INFO L168 Benchmark]: Toolchain (without parser) took 5677.98 ms. Allocated memory was 649.6 MB in the beginning and 755.0 MB in the end (delta: 105.4 MB). Free memory was 563.5 MB in the beginning and 581.7 MB in the end (delta: -18.2 MB). Peak memory consumption was 87.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,484 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:27:14,484 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.42 ms. Allocated memory was 649.6 MB in the beginning and 652.7 MB in the end (delta: 3.1 MB). Free memory was 563.5 MB in the beginning and 616.6 MB in the end (delta: -53.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,485 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 652.7 MB. Free memory was 616.6 MB in the beginning and 614.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,485 INFO L168 Benchmark]: Boogie Preprocessor took 23.75 ms. Allocated memory is still 652.7 MB. Free memory was 614.5 MB in the beginning and 613.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,486 INFO L168 Benchmark]: RCFGBuilder took 264.71 ms. Allocated memory is still 652.7 MB. Free memory was 613.4 MB in the beginning and 595.3 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,487 INFO L168 Benchmark]: BlockEncodingV2 took 90.67 ms. Allocated memory is still 652.7 MB. Free memory was 595.3 MB in the beginning and 588.8 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,487 INFO L168 Benchmark]: TraceAbstraction took 3084.43 ms. Allocated memory was 652.7 MB in the beginning and 731.9 MB in the end (delta: 79.2 MB). Free memory was 587.8 MB in the beginning and 519.0 MB in the end (delta: 68.8 MB). Peak memory consumption was 147.9 MB. Max. memory is 50.3 GB. [2020-06-22 10:27:14,488 INFO L168 Benchmark]: BuchiAutomizer took 1858.92 ms. Allocated memory was 731.9 MB in the beginning and 755.0 MB in the end (delta: 23.1 MB). Free memory was 519.0 MB in the beginning and 581.7 MB in the end (delta: -62.7 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:27:14,493 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 18 locations, 23 edges - StatisticsResult: Encoded RCFG 12 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 310.42 ms. Allocated memory was 649.6 MB in the beginning and 652.7 MB in the end (delta: 3.1 MB). Free memory was 563.5 MB in the beginning and 616.6 MB in the end (delta: -53.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.83 ms. Allocated memory is still 652.7 MB. Free memory was 616.6 MB in the beginning and 614.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.75 ms. Allocated memory is still 652.7 MB. Free memory was 614.5 MB in the beginning and 613.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 264.71 ms. Allocated memory is still 652.7 MB. Free memory was 613.4 MB in the beginning and 595.3 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 90.67 ms. Allocated memory is still 652.7 MB. Free memory was 595.3 MB in the beginning and 588.8 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3084.43 ms. Allocated memory was 652.7 MB in the beginning and 731.9 MB in the end (delta: 79.2 MB). Free memory was 587.8 MB in the beginning and 519.0 MB in the end (delta: 68.8 MB). Peak memory consumption was 147.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1858.92 ms. Allocated memory was 731.9 MB in the beginning and 755.0 MB in the end (delta: 23.1 MB). Free memory was 519.0 MB in the beginning and 581.7 MB in the end (delta: -62.7 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 11]: Loop Invariant [2020-06-22 10:27:14,501 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,502 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,503 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:27:14,504 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((p == 0 && n <= unknown-#length-unknown[s]) && 1 == \valid[s]) && 1 == \valid[p]) && n <= unknown-#length-unknown[p]) && 1 <= n) && 0 == s) && 1 <= n) || (((((((n <= unknown-#length-unknown[s] && 1 == \valid[s]) && 1 == \valid[p]) && p + n <= unknown-#length-unknown[p]) && 1 <= p) && 1 <= n) && 0 == s) && 1 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 2 error locations. SAFE Result, 3.0s OverallTime, 9 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 37 SDtfs, 161 SDslu, 344 SDs, 0 SdLazy, 645 SolverSat, 68 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 21 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 3 NumberOfFragments, 70 HoareAnnotationTreeSize, 1 FomulaSimplifications, 160 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 139 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 143 ConstructedInterpolants, 0 QuantifiedInterpolants, 7810 SizeOfPredicates, 27 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 21/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (2 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[alloca(n * sizeof(char))] and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 73 SDslu, 95 SDs, 0 SdLazy, 153 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax100 hnf100 lsp92 ukn99 mio100 lsp51 div157 bol100 ite100 ukn100 eq143 hnf76 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 3 VariablesLoop: 6 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:27:05.579 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:27:14.735 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check