./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f6fb2bb1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4ab4fc7901859c456c176827e7d5fcf9e4988b17 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-f6fb2bb [2019-11-19 19:56:00,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 19:56:00,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 19:56:00,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 19:56:00,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 19:56:00,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 19:56:00,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 19:56:00,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 19:56:00,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 19:56:00,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 19:56:00,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 19:56:00,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 19:56:00,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 19:56:00,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 19:56:00,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 19:56:00,444 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 19:56:00,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 19:56:00,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 19:56:00,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 19:56:00,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 19:56:00,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 19:56:00,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 19:56:00,466 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 19:56:00,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 19:56:00,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 19:56:00,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 19:56:00,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 19:56:00,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 19:56:00,474 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 19:56:00,475 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 19:56:00,475 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 19:56:00,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 19:56:00,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 19:56:00,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 19:56:00,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 19:56:00,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 19:56:00,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 19:56:00,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 19:56:00,482 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 19:56:00,483 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 19:56:00,484 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 19:56:00,485 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-19 19:56:00,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 19:56:00,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 19:56:00,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 19:56:00,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 19:56:00,531 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 19:56:00,531 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-19 19:56:00,533 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-19 19:56:00,533 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-19 19:56:00,534 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-19 19:56:00,534 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-19 19:56:00,534 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-19 19:56:00,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 19:56:00,535 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-19 19:56:00,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 19:56:00,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 19:56:00,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-19 19:56:00,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-19 19:56:00,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-19 19:56:00,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 19:56:00,538 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-19 19:56:00,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 19:56:00,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-19 19:56:00,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 19:56:00,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 19:56:00,540 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-19 19:56:00,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 19:56:00,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 19:56:00,541 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-19 19:56:00,542 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-19 19:56:00,542 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ab4fc7901859c456c176827e7d5fcf9e4988b17 [2019-11-19 19:56:00,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 19:56:00,881 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 19:56:00,885 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 19:56:00,886 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 19:56:00,887 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 19:56:00,888 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-19 19:56:00,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378a528ae/151285ea89974852958435f94dc0d62b/FLAG7b16cfcce [2019-11-19 19:56:01,516 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 19:56:01,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-19 19:56:01,538 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378a528ae/151285ea89974852958435f94dc0d62b/FLAG7b16cfcce [2019-11-19 19:56:01,746 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/378a528ae/151285ea89974852958435f94dc0d62b [2019-11-19 19:56:01,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 19:56:01,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 19:56:01,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 19:56:01,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 19:56:01,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 19:56:01,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:01" (1/1) ... [2019-11-19 19:56:01,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fcced14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:01, skipping insertion in model container [2019-11-19 19:56:01,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:56:01" (1/1) ... [2019-11-19 19:56:01,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 19:56:01,807 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 19:56:02,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:56:02,202 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 19:56:02,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 19:56:02,310 INFO L192 MainTranslator]: Completed translation [2019-11-19 19:56:02,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02 WrapperNode [2019-11-19 19:56:02,311 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 19:56:02,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 19:56:02,312 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 19:56:02,312 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 19:56:02,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 19:56:02,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 19:56:02,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 19:56:02,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 19:56:02,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,371 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... [2019-11-19 19:56:02,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 19:56:02,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 19:56:02,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 19:56:02,387 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 19:56:02,388 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:02,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 19:56:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 19:56:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 19:56:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 19:56:02,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 19:56:02,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 19:56:02,811 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 19:56:02,812 INFO L285 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-19 19:56:02,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:02 BoogieIcfgContainer [2019-11-19 19:56:02,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 19:56:02,814 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-19 19:56:02,814 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-19 19:56:02,818 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-19 19:56:02,819 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:56:02,819 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.11 07:56:01" (1/3) ... [2019-11-19 19:56:02,820 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f6b3781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:56:02, skipping insertion in model container [2019-11-19 19:56:02,820 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:56:02,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:56:02" (2/3) ... [2019-11-19 19:56:02,821 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f6b3781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.11 07:56:02, skipping insertion in model container [2019-11-19 19:56:02,821 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-19 19:56:02,821 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:02" (3/3) ... [2019-11-19 19:56:02,823 INFO L371 chiAutomizerObserver]: Analyzing ICFG Ben-Amram-2010LMCS-Ex2.3-alloca.i [2019-11-19 19:56:02,875 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-19 19:56:02,875 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-19 19:56:02,876 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-19 19:56:02,876 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 19:56:02,876 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 19:56:02,876 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-19 19:56:02,877 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 19:56:02,877 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-19 19:56:02,890 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-19 19:56:02,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:02,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:02,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:02,918 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 19:56:02,918 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:02,918 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-19 19:56:02,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-19 19:56:02,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:02,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:02,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:02,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-19 19:56:02,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:02,928 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 5#L555-2true [2019-11-19 19:56:02,928 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 6#L554-1true assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 9#L554-3true main_#t~short12 := main_#t~short10; 11#L554-4true assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 4#L554-6true assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 12#L555true assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 5#L555-2true [2019-11-19 19:56:02,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:02,934 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-19 19:56:02,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:02,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41686988] [2019-11-19 19:56:02,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:03,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:03,123 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:03,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:03,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-11-19 19:56:03,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:03,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172459313] [2019-11-19 19:56:03,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:03,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:03,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:03,219 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-11-19 19:56:03,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:03,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467419757] [2019-11-19 19:56:03,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:03,318 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:03,713 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 19:56:04,176 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2019-11-19 19:56:04,344 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-19 19:56:04,359 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:56:04,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:56:04,361 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:56:04,361 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:56:04,361 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:56:04,362 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:04,362 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:56:04,362 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:56:04,362 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration1_Lasso [2019-11-19 19:56:04,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:56:04,363 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:56:04,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:04,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:04,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:04,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:04,897 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 72 [2019-11-19 19:56:05,085 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-19 19:56:05,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:05,420 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-19 19:56:06,109 WARN L191 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-19 19:56:06,317 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:56:06,323 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,349 INFO L120 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 [2019-11-19 19:56:06,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:06,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:06,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:06,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,382 INFO L120 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 [2019-11-19 19:56:06,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:06,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:06,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:06,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:06,408 INFO L120 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 [2019-11-19 19:56:06,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:06,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,415 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:06,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,434 INFO L120 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 [2019-11-19 19:56:06,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,447 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:06,448 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:06,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,469 INFO L120 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 [2019-11-19 19:56:06,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,476 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:06,476 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:06,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,490 INFO L120 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 [2019-11-19 19:56:06,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:06,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:06,502 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,519 INFO L120 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 [2019-11-19 19:56:06,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,522 INFO L203 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-19 19:56:06,522 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,554 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-19 19:56:06,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:06,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,598 INFO L120 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 [2019-11-19 19:56:06,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,614 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:06,614 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:06,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:06,666 INFO L120 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 [2019-11-19 19:56:06,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,673 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:06,674 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:06,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:06,696 INFO L120 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 [2019-11-19 19:56:06,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:06,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:06,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:06,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:06,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:06,707 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,719 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:56:06,809 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-19 19:56:06,809 INFO L444 ModelExtractionUtils]: 9 out of 16 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:06,847 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:06,852 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 19:56:06,852 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:56:06,853 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 Supporting invariants [] [2019-11-19 19:56:06,988 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-19 19:56:07,004 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 19:56:07,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 19:56:07,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 19:56:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:07,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:07,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:56:07,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:07,103 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 19:56:07,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:07,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:07,237 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-19 19:56:07,239 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2019-11-19 19:56:07,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 10 states. [2019-11-19 19:56:07,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:07,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-19 19:56:07,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-11-19 19:56:07,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-19 19:56:07,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:07,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-19 19:56:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:07,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-19 19:56:07,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:07,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-19 19:56:07,420 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:07,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 20 states and 29 transitions. [2019-11-19 19:56:07,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-19 19:56:07,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 19:56:07,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 29 transitions. [2019-11-19 19:56:07,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:07,427 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-19 19:56:07,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 29 transitions. [2019-11-19 19:56:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 19:56:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 19:56:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-11-19 19:56:07,459 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-19 19:56:07,459 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-11-19 19:56:07,459 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-19 19:56:07,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-11-19 19:56:07,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:07,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:07,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:07,461 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:07,461 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:07,462 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 209#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 210#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 215#L554-1 assume !main_#t~short10; 216#L554-3 main_#t~short12 := main_#t~short10; 219#L554-4 assume !main_#t~short12; 205#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 206#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 211#L555-2 [2019-11-19 19:56:07,462 INFO L796 eck$LassoCheckResult]: Loop: 211#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 212#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 224#L554-3 main_#t~short12 := main_#t~short10; 223#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 222#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 221#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 211#L555-2 [2019-11-19 19:56:07,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash 179475346, now seen corresponding path program 1 times [2019-11-19 19:56:07,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:07,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909897653] [2019-11-19 19:56:07,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:07,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909897653] [2019-11-19 19:56:07,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:56:07,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 19:56:07,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246954699] [2019-11-19 19:56:07,535 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:56:07,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:07,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-11-19 19:56:07,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:07,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699704586] [2019-11-19 19:56:07,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:07,599 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:07,859 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 19:56:07,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:07,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 19:56:07,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 19:56:07,933 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-19 19:56:07,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:07,951 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-11-19 19:56:07,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 19:56:07,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-11-19 19:56:07,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:07,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 26 transitions. [2019-11-19 19:56:07,955 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 19:56:07,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 19:56:07,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2019-11-19 19:56:07,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:07,955 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-19 19:56:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2019-11-19 19:56:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 19:56:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 19:56:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2019-11-19 19:56:07,960 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-19 19:56:07,960 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2019-11-19 19:56:07,960 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-19 19:56:07,960 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 26 transitions. [2019-11-19 19:56:07,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:07,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:07,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:07,962 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:07,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:07,963 INFO L794 eck$LassoCheckResult]: Stem: 267#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 254#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 255#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 264#L554-1 assume !main_#t~short10; 265#L554-3 main_#t~short12 := main_#t~short10; 268#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 256#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 257#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 260#L555-2 [2019-11-19 19:56:07,963 INFO L796 eck$LassoCheckResult]: Loop: 260#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 261#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 273#L554-3 main_#t~short12 := main_#t~short10; 272#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 271#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 270#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 260#L555-2 [2019-11-19 19:56:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 179473424, now seen corresponding path program 1 times [2019-11-19 19:56:07,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:07,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171177609] [2019-11-19 19:56:07,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:08,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171177609] [2019-11-19 19:56:08,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 19:56:08,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 19:56:08,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70160912] [2019-11-19 19:56:08,056 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-19 19:56:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:08,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 3 times [2019-11-19 19:56:08,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:08,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7914767] [2019-11-19 19:56:08,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:08,110 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:08,382 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 19:56:08,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 19:56:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 19:56:08,450 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-11-19 19:56:08,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:08,485 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2019-11-19 19:56:08,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 19:56:08,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. [2019-11-19 19:56:08,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:08,488 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 23 transitions. [2019-11-19 19:56:08,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 19:56:08,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 19:56:08,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-11-19 19:56:08,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:08,489 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-19 19:56:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-11-19 19:56:08,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-19 19:56:08,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-19 19:56:08,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-11-19 19:56:08,492 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-19 19:56:08,492 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-11-19 19:56:08,492 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-19 19:56:08,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-11-19 19:56:08,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:08,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:08,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:08,494 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:08,494 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:08,495 INFO L794 eck$LassoCheckResult]: Stem: 322#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 313#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 314#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 319#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 320#L554-3 main_#t~short12 := main_#t~short10; 323#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 309#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 310#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 315#L555-2 [2019-11-19 19:56:08,495 INFO L796 eck$LassoCheckResult]: Loop: 315#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 316#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 328#L554-3 main_#t~short12 := main_#t~short10; 327#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 326#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 325#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 315#L555-2 [2019-11-19 19:56:08,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:08,496 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-11-19 19:56:08,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:08,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514415698] [2019-11-19 19:56:08,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:08,531 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:08,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:08,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 4 times [2019-11-19 19:56:08,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:08,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393892262] [2019-11-19 19:56:08,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:08,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -692497897, now seen corresponding path program 1 times [2019-11-19 19:56:08,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:08,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892384114] [2019-11-19 19:56:08,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:08,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:08,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892384114] [2019-11-19 19:56:08,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348981539] [2019-11-19 19:56:08,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 19:56:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:08,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:56:08,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:08,819 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:08,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 100 [2019-11-19 19:56:08,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:08,864 INFO L567 ElimStorePlain]: treesize reduction 55, result has 32.9 percent of original size [2019-11-19 19:56:08,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:08,865 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:24 [2019-11-19 19:56:08,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:08,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 19:56:08,911 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:08,926 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:08,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 20 [2019-11-19 19:56:08,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:08,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:08,939 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 19:56:08,958 INFO L567 ElimStorePlain]: treesize reduction 20, result has 13.0 percent of original size [2019-11-19 19:56:08,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:08,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:3 [2019-11-19 19:56:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:08,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 19:56:08,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-11-19 19:56:08,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787235631] [2019-11-19 19:56:09,230 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-19 19:56:09,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 19:56:09,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 19:56:09,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 19:56:09,311 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 8 states. [2019-11-19 19:56:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 19:56:09,490 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2019-11-19 19:56:09,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 19:56:09,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 22 transitions. [2019-11-19 19:56:09,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:09,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 22 transitions. [2019-11-19 19:56:09,494 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-19 19:56:09,494 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-19 19:56:09,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2019-11-19 19:56:09,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:09,495 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2019-11-19 19:56:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2019-11-19 19:56:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-19 19:56:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 19:56:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-11-19 19:56:09,498 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-19 19:56:09,498 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-11-19 19:56:09,498 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-19 19:56:09,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-11-19 19:56:09,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:09,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:09,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:09,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-19 19:56:09,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:09,500 INFO L794 eck$LassoCheckResult]: Stem: 419#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 411#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 412#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-11-19 19:56:09,500 INFO L796 eck$LassoCheckResult]: Loop: 414#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 417#L554-3 main_#t~short12 := main_#t~short10; 420#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 407#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 408#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 413#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 414#L554-1 [2019-11-19 19:56:09,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-19 19:56:09,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:09,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071840727] [2019-11-19 19:56:09,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:09,520 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:09,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:09,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 1 times [2019-11-19 19:56:09,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:09,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97399578] [2019-11-19 19:56:09,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:09,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:09,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:09,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450553, now seen corresponding path program 2 times [2019-11-19 19:56:09,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:09,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765710364] [2019-11-19 19:56:09,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:09,596 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:09,896 WARN L191 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-19 19:56:10,109 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 19:56:10,460 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 92 [2019-11-19 19:56:10,857 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-19 19:56:10,862 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:56:10,862 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:56:10,862 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:56:10,862 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:56:10,862 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:56:10,862 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:10,862 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:56:10,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:56:10,862 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration5_Lasso [2019-11-19 19:56:10,863 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:56:10,863 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:56:10,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:11,796 WARN L191 SmtUtils]: Spent 765.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2019-11-19 19:56:12,038 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-19 19:56:12,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:12,236 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-11-19 19:56:13,221 WARN L191 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-19 19:56:13,341 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-11-19 19:56:13,493 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-11-19 19:56:13,591 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:56:13,591 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:13,601 INFO L120 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 [2019-11-19 19:56:13,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:13,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:13,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:13,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:13,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:13,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:13,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:13,647 INFO L120 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 [2019-11-19 19:56:13,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:13,649 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:13,649 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:13,649 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:13,653 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:13,653 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:13,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:13,677 INFO L120 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 [2019-11-19 19:56:13,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:13,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:13,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:13,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:13,681 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:13,681 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:13,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:13,701 INFO L120 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 [2019-11-19 19:56:13,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:13,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:13,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:13,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:13,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:13,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:13,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:56:13,722 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-19 19:56:13,722 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:13,729 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 19:56:13,734 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-19 19:56:13,734 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:56:13,734 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_2 Supporting invariants [] [2019-11-19 19:56:13,845 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-19 19:56:13,851 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 19:56:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:13,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:56:13,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:13,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:13,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 19:56:13,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:13,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:13,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:13,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 19:56:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:13,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:56:13,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:14,049 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:14,051 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 19:56:14,053 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:14,099 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 19:56:14,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:56:14,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 19:56:14,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:14,145 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 19:56:14,146 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 7 states. [2019-11-19 19:56:14,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 7 states. Result 37 states and 40 transitions. Complement of second has 10 states. [2019-11-19 19:56:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 19:56:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-11-19 19:56:14,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-19 19:56:14,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:14,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 19:56:14,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:14,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 10 transitions. Stem has 3 letters. Loop has 12 letters. [2019-11-19 19:56:14,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:14,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 40 transitions. [2019-11-19 19:56:14,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:14,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 20 states and 21 transitions. [2019-11-19 19:56:14,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-19 19:56:14,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-11-19 19:56:14,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 21 transitions. [2019-11-19 19:56:14,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-19 19:56:14,239 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-19 19:56:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 21 transitions. [2019-11-19 19:56:14,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2019-11-19 19:56:14,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-11-19 19:56:14,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-11-19 19:56:14,240 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 19:56:14,240 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-11-19 19:56:14,240 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-19 19:56:14,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2019-11-19 19:56:14,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-19 19:56:14,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-19 19:56:14,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-19 19:56:14,242 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 19:56:14,242 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-19 19:56:14,242 INFO L794 eck$LassoCheckResult]: Stem: 630#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 623#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~nondet16, main_#t~mem17, main_#t~mem18, main_#t~nondet19, main_#t~mem20, main_#t~mem8, main_#t~mem9, main_#t~short10, main_#t~mem11, main_#t~short12, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet5;call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~nondet6;call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet7; 624#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 625#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 629#L554-3 main_#t~short12 := main_#t~short10; 632#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 621#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 622#L555 assume main_#t~mem13 > main_#t~mem14;havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16;call main_#t~mem17 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem17 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem17; 626#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-11-19 19:56:14,242 INFO L796 eck$LassoCheckResult]: Loop: 627#L554-1 assume main_#t~short10;call main_#t~mem9 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem9 > 0; 628#L554-3 main_#t~short12 := main_#t~short10; 631#L554-4 assume main_#t~short12;call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short12 := main_#t~mem11 > 0; 619#L554-6 assume !!main_#t~short12;havoc main_#t~mem9;havoc main_#t~short10;havoc main_#t~mem8;havoc main_#t~short12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4); 620#L555 assume !(main_#t~mem13 > main_#t~mem14);havoc main_#t~mem13;havoc main_#t~mem14;call main_#t~mem18 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem18 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem18;call write~int(main_#t~nondet19, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet19;call main_#t~mem20 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem20 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem20; 633#L555-2 call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short10 := main_#t~mem8 > 0; 627#L554-1 [2019-11-19 19:56:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450491, now seen corresponding path program 2 times [2019-11-19 19:56:14,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:14,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348244226] [2019-11-19 19:56:14,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:14,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:14,271 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:14,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:14,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1187255894, now seen corresponding path program 2 times [2019-11-19 19:56:14,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:14,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534285711] [2019-11-19 19:56:14,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:14,289 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:14,290 INFO L82 PathProgramCache]: Analyzing trace with hash 816748368, now seen corresponding path program 2 times [2019-11-19 19:56:14,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 19:56:14,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152275840] [2019-11-19 19:56:14,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 19:56:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 19:56:14,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 19:56:14,642 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2019-11-19 19:56:14,848 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 19:56:15,839 WARN L191 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 128 [2019-11-19 19:56:16,761 WARN L191 SmtUtils]: Spent 905.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2019-11-19 19:56:16,765 INFO L210 LassoAnalysis]: Preferences: [2019-11-19 19:56:16,765 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-19 19:56:16,765 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-19 19:56:16,765 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-19 19:56:16,765 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-19 19:56:16,765 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:16,765 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-19 19:56:16,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-19 19:56:16,766 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ben-Amram-2010LMCS-Ex2.3-alloca.i_Iteration6_Lasso [2019-11-19 19:56:16,766 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-19 19:56:16,766 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-19 19:56:16,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:16,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:17,949 WARN L191 SmtUtils]: Spent 932.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 86 [2019-11-19 19:56:18,166 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-19 19:56:18,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:18,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:18,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:18,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:18,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:18,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-19 19:56:18,533 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-19 19:56:18,844 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-19 19:56:19,050 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-11-19 19:56:19,654 WARN L191 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-19 19:56:19,686 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-19 19:56:19,687 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,694 INFO L120 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 [2019-11-19 19:56:19,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,706 INFO L120 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 [2019-11-19 19:56:19,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,716 INFO L120 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 [2019-11-19 19:56:19,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,720 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,720 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:19,725 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,731 INFO L120 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 [2019-11-19 19:56:19,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,734 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,746 INFO L120 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 [2019-11-19 19:56:19,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,748 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,749 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,757 INFO L120 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 [2019-11-19 19:56:19,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:19,763 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:19,770 INFO L120 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 Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,773 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,773 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,774 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,781 INFO L120 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 [2019-11-19 19:56:19,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,804 INFO L120 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 [2019-11-19 19:56:19,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,807 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,807 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,810 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,810 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:19,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:19,825 INFO L120 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 [2019-11-19 19:56:19,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,828 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,828 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,838 INFO L120 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 [2019-11-19 19:56:19,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,848 INFO L120 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 [2019-11-19 19:56:19,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,859 INFO L120 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 [2019-11-19 19:56:19,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-19 19:56:19,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-19 19:56:19,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-19 19:56:19,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,870 INFO L120 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 [2019-11-19 19:56:19,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,872 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,872 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,875 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,875 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:19,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,890 INFO L120 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 [2019-11-19 19:56:19,891 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:19,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,909 INFO L120 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 [2019-11-19 19:56:19,910 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,910 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,910 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,912 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,912 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-19 19:56:19,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:19,929 INFO L120 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 [2019-11-19 19:56:19,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-19 19:56:19,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-19 19:56:19,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-19 19:56:19,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-19 19:56:19,934 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-19 19:56:19,945 INFO L120 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 [2019-11-19 19:56:19,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-19 19:56:19,948 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-19 19:56:19,948 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-19 19:56:19,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:19,970 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-19 19:56:19,970 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-19 19:56:20,021 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-19 19:56:20,088 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2019-11-19 19:56:20,088 INFO L444 ModelExtractionUtils]: 16 out of 36 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-19 19:56:20,094 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-19 19:56:20,097 INFO L438 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-11-19 19:56:20,098 INFO L510 LassoAnalysis]: Proved termination. [2019-11-19 19:56:20,098 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_3 Supporting invariants [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Exception during sending of exit command (exit): Broken pipe [2019-11-19 19:56:20,237 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-19 19:56:20,243 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-19 19:56:20,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:20,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:56:20,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:20,314 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:20,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 19:56:20,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:20,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:20,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:20,323 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 19:56:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:20,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:56:20,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:20,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:20,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:20,457 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 19:56:20,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:20,511 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 19:56:20,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:56:20,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 19:56:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:20,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 19:56:20,551 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 19:56:20,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-11-19 19:56:20,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 19:56:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-19 19:56:20,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 19:56:20,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:20,649 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 19:56:20,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:20,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:56:20,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:20,714 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:20,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 19:56:20,715 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:20,721 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:20,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:20,722 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 19:56:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:20,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:56:20,752 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:20,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:20,848 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:20,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 19:56:20,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:20,905 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 19:56:20,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:56:20,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 19:56:20,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:20,946 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-19 19:56:20,946 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 19:56:21,022 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 24 states and 25 transitions. Complement of second has 10 states. [2019-11-19 19:56:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 19:56:21,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-11-19 19:56:21,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 19:56:21,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:21,023 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-19 19:56:21,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 19:56:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:21,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 19:56:21,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:21,084 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:21,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-19 19:56:21,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:21,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:21,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 19:56:21,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-19 19:56:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 19:56:21,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 19:56:21,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 19:56:21,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 19:56:21,206 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 19:56:21,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 58 [2019-11-19 19:56:21,208 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 19:56:21,256 INFO L567 ElimStorePlain]: treesize reduction 18, result has 73.1 percent of original size [2019-11-19 19:56:21,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 19:56:21,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:108, output treesize:42 [2019-11-19 19:56:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 19:56:21,293 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 4 loop predicates [2019-11-19 19:56:21,294 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand 7 states. [2019-11-19 19:56:21,391 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand 7 states. Result 26 states and 28 transitions. Complement of second has 11 states. [2019-11-19 19:56:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-19 19:56:21,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-19 19:56:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-11-19 19:56:21,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-19 19:56:21,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:21,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-19 19:56:21,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:21,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 12 letters. [2019-11-19 19:56:21,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-19 19:56:21,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2019-11-19 19:56:21,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 19:56:21,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 0 states and 0 transitions. [2019-11-19 19:56:21,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-19 19:56:21,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-19 19:56:21,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-19 19:56:21,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-19 19:56:21,398 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:56:21,398 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:56:21,398 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 19:56:21,398 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-19 19:56:21,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-19 19:56:21,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-19 19:56:21,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-19 19:56:21,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.11 07:56:21 BoogieIcfgContainer [2019-11-19 19:56:21,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-19 19:56:21,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 19:56:21,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 19:56:21,406 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 19:56:21,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:56:02" (3/4) ... [2019-11-19 19:56:21,410 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 19:56:21,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 19:56:21,412 INFO L168 Benchmark]: Toolchain (without parser) took 19661.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 361.8 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -288.4 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:21,412 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:56:21,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 560.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:21,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:56:21,414 INFO L168 Benchmark]: Boogie Preprocessor took 29.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:21,414 INFO L168 Benchmark]: RCFGBuilder took 426.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:21,415 INFO L168 Benchmark]: BuchiAutomizer took 18591.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -170.1 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. [2019-11-19 19:56:21,415 INFO L168 Benchmark]: Witness Printer took 4.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 19:56:21,418 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 560.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -150.8 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 426.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18591.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -170.1 MB). Peak memory consumption was 70.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.89 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + unknown-#memory_int-unknown[y][y] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[z][z] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 16.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 47 SDtfs, 51 SDslu, 48 SDs, 0 SdLazy, 144 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital1031 mio100 ax103 hnf99 lsp64 ukn56 mio100 lsp28 div100 bol104 ite100 ukn100 eq174 hnf88 smp97 dnf301 smp90 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 20 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! Received shutdown request...