./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer --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 a398041f87cd84898ae142142fdf4872d746c3b1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:28:23,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:28:23,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:28:23,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:28:23,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:28:23,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:28:23,676 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:28:23,678 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:28:23,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:28:23,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:28:23,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:28:23,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:28:23,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:28:23,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:28:23,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:28:23,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:28:23,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:28:23,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:28:23,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:28:23,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:28:23,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:28:23,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:28:23,694 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:28:23,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:28:23,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:28:23,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:28:23,697 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:28:23,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:28:23,698 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:28:23,699 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:28:23,699 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:28:23,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:28:23,700 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:28:23,701 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:28:23,702 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:28:23,702 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:28:23,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:28:23,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:28:23,703 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:28:23,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:28:23,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:28:23,705 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-16 00:28:23,719 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:28:23,720 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:28:23,721 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:28:23,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:28:23,721 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:28:23,721 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:28:23,722 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:28:23,722 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:28:23,722 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:28:23,722 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:28:23,722 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:28:23,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:28:23,723 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:28:23,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:28:23,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:28:23,723 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:28:23,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:28:23,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:28:23,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:28:23,724 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:28:23,724 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:28:23,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:28:23,725 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:28:23,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:28:23,725 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:28:23,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:28:23,726 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:28:23,726 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:28:23,727 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:28:23,727 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer 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 -> a398041f87cd84898ae142142fdf4872d746c3b1 [2019-11-16 00:28:23,751 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:28:23,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:28:23,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:28:23,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:28:23,765 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:28:23,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2019-11-16 00:28:23,819 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/data/623533d7f/5be474fb9cb9484abb2699decd078037/FLAG350bffa06 [2019-11-16 00:28:24,284 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:28:24,284 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/sv-benchmarks/c/termination-memory-alloca/b.17-alloca.i [2019-11-16 00:28:24,305 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/data/623533d7f/5be474fb9cb9484abb2699decd078037/FLAG350bffa06 [2019-11-16 00:28:24,633 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/data/623533d7f/5be474fb9cb9484abb2699decd078037 [2019-11-16 00:28:24,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:28:24,640 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:28:24,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:24,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:28:24,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:28:24,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:24" (1/1) ... [2019-11-16 00:28:24,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c02b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:24, skipping insertion in model container [2019-11-16 00:28:24,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:24" (1/1) ... [2019-11-16 00:28:24,668 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:28:24,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:28:25,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:25,157 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:28:25,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:28:25,263 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:28:25,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25 WrapperNode [2019-11-16 00:28:25,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:28:25,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:28:25,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:28:25,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:28:25,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:28:25,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:28:25,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:28:25,308 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:28:25,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,317 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... [2019-11-16 00:28:25,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:28:25,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:28:25,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:28:25,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:28:25,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/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-16 00:28:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:28:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:28:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:28:25,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:28:25,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:28:25,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:28:25,713 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:28:25,713 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:28:25,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:25 BoogieIcfgContainer [2019-11-16 00:28:25,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:28:25,716 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:28:25,716 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:28:25,719 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:28:25,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:28:25,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:28:24" (1/3) ... [2019-11-16 00:28:25,722 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432f61d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:28:25, skipping insertion in model container [2019-11-16 00:28:25,722 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:28:25,725 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:25" (2/3) ... [2019-11-16 00:28:25,726 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432f61d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:28:25, skipping insertion in model container [2019-11-16 00:28:25,726 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:28:25,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:25" (3/3) ... [2019-11-16 00:28:25,728 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.17-alloca.i [2019-11-16 00:28:25,785 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:28:25,786 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:28:25,786 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:28:25,786 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:28:25,786 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:28:25,786 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:28:25,788 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:28:25,788 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:28:25,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-16 00:28:25,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:25,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:25,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:25,838 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:28:25,838 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:28:25,838 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:28:25,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-11-16 00:28:25,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:25,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:25,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:25,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:28:25,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-16 00:28:25,849 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 13#L557-3true [2019-11-16 00:28:25,849 INFO L793 eck$LassoCheckResult]: Loop: 13#L557-3true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 8#L557-1true assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 11#L558-3true assume !true; 14#L558-4true call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 13#L557-3true [2019-11-16 00:28:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-16 00:28:25,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:25,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499916745] [2019-11-16 00:28:25,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:25,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:25,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,087 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:26,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:26,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2019-11-16 00:28:26,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:26,089 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931014894] [2019-11-16 00:28:26,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:26,128 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-16 00:28:26,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931014894] [2019-11-16 00:28:26,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:26,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:28:26,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897415305] [2019-11-16 00:28:26,135 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-16 00:28:26,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:28:26,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:28:26,150 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-11-16 00:28:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:26,156 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-11-16 00:28:26,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:28:26,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-11-16 00:28:26,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:26,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2019-11-16 00:28:26,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-16 00:28:26,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-11-16 00:28:26,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-11-16 00:28:26,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:28:26,167 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-16 00:28:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-11-16 00:28:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-16 00:28:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-16 00:28:26,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-11-16 00:28:26,197 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-16 00:28:26,198 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-11-16 00:28:26,198 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:28:26,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-11-16 00:28:26,199 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:26,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:26,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:26,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-16 00:28:26,200 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:28:26,200 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 32#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 33#L557-3 [2019-11-16 00:28:26,200 INFO L793 eck$LassoCheckResult]: Loop: 33#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 38#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 37#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 35#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 36#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 33#L557-3 [2019-11-16 00:28:26,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:26,201 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-16 00:28:26,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:26,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857277158] [2019-11-16 00:28:26,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,275 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:26,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:26,275 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2019-11-16 00:28:26,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:26,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594707361] [2019-11-16 00:28:26,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,297 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:26,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:26,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2019-11-16 00:28:26,298 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:26,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356092618] [2019-11-16 00:28:26,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,299 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:26,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:26,535 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-16 00:28:27,480 WARN L191 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2019-11-16 00:28:27,785 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-16 00:28:27,803 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:28:27,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:28:27,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:28:27,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:28:27,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:28:27,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:28:27,818 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:28:27,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:28:27,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration2_Lasso [2019-11-16 00:28:27,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:28:27,820 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:28:27,879 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-16 00:28:27,886 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-16 00:28:27,890 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-16 00:28:27,898 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-16 00:28:27,903 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-16 00:28:28,710 WARN L191 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 96 [2019-11-16 00:28:28,898 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-16 00:28:28,898 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-16 00:28:28,902 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-16 00:28:28,905 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-16 00:28:28,908 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-16 00:28:28,911 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-16 00:28:28,913 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-16 00:28:28,916 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-16 00:28:28,918 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-16 00:28:28,920 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-16 00:28:28,922 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-16 00:28:28,925 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-16 00:28:28,933 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-16 00:28:30,451 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:28:30,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:28:30,612 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:28:30,613 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-16 00:28:30,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:30,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,619 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:30,619 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:30,621 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,622 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-16 00:28:30,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,623 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:30,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:30,624 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:30,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,626 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-16 00:28:30,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,630 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,630 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,634 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-16 00:28:30,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,638 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,638 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,644 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-16 00:28:30,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,647 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,653 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-16 00:28:30,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,660 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-16 00:28:30,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,664 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,664 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,678 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-16 00:28:30,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,679 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,689 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,689 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,743 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-16 00:28:30,744 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,745 INFO L202 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-16 00:28:30,745 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,745 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,764 INFO L400 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2019-11-16 00:28:30,764 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,884 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-16 00:28:30,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,885 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,887 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,887 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,889 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,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-16 00:28:30,890 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,891 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,892 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,892 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,895 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-16 00:28:30,896 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,897 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,897 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,899 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,899 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-16 00:28:30,900 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,900 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,900 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,900 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,902 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,902 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,906 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,907 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-16 00:28:30,907 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,908 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,908 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,913 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,914 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:30,920 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-16 00:28:30,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:30,921 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:30,921 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:30,921 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:30,928 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:30,928 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:30,962 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:28:31,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:28:31,004 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-16 00:28:31,007 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:28:31,009 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:28:31,010 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:28:31,010 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2019-11-16 00:28:31,207 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2019-11-16 00:28:31,219 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:28:31,220 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:28:31,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:31,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:31,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:31,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:28:31,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:31,359 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-16 00:28:31,362 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-16 00:28:31,363 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-11-16 00:28:31,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 17 states and 20 transitions. Complement of second has 7 states. [2019-11-16 00:28:31,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:28:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:28:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2019-11-16 00:28:31,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2019-11-16 00:28:31,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:31,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2019-11-16 00:28:31,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:31,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2019-11-16 00:28:31,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:31,438 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2019-11-16 00:28:31,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:31,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2019-11-16 00:28:31,440 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-16 00:28:31,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-16 00:28:31,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-16 00:28:31,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:28:31,440 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-16 00:28:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-16 00:28:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-16 00:28:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-16 00:28:31,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-16 00:28:31,445 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-16 00:28:31,446 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-16 00:28:31,446 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:28:31,446 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-16 00:28:31,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:31,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:31,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:31,448 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:28:31,448 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-16 00:28:31,449 INFO L791 eck$LassoCheckResult]: Stem: 252#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 250#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 251#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 257#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 258#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 253#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 254#L558-3 [2019-11-16 00:28:31,449 INFO L793 eck$LassoCheckResult]: Loop: 254#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 264#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 254#L558-3 [2019-11-16 00:28:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:31,449 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2019-11-16 00:28:31,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:31,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860452134] [2019-11-16 00:28:31,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:31,554 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:31,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:31,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2019-11-16 00:28:31,559 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:31,559 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478155972] [2019-11-16 00:28:31,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,560 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:31,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:31,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2019-11-16 00:28:31,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:31,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57911237] [2019-11-16 00:28:31,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:31,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:31,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:32,517 WARN L191 SmtUtils]: Spent 787.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2019-11-16 00:28:32,809 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-11-16 00:28:32,811 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:28:32,812 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:28:32,812 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:28:32,812 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:28:32,812 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:28:32,812 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:28:32,812 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:28:32,812 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:28:32,812 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration3_Lasso [2019-11-16 00:28:32,812 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:28:32,813 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:28:32,818 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-16 00:28:32,825 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-16 00:28:32,828 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-16 00:28:32,831 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-16 00:28:32,834 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-16 00:28:32,836 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-16 00:28:32,838 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-16 00:28:32,841 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-16 00:28:32,844 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-16 00:28:32,846 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-16 00:28:32,848 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-16 00:28:32,852 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-16 00:28:32,862 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-16 00:28:33,466 WARN L191 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-11-16 00:28:33,572 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-16 00:28:33,574 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-16 00:28:33,577 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-16 00:28:35,165 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:28:35,254 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:28:35,255 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:28:35,255 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-16 00:28:35,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,257 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,257 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,257 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,258 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-16 00:28:35,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,259 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,260 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,261 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-16 00:28:35,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,262 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,262 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,263 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,263 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,264 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-16 00:28:35,265 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,265 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,265 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,265 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,266 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,266 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,268 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-16 00:28:35,269 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,269 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,269 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,269 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,269 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,270 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,270 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,271 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-16 00:28:35,271 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,271 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,271 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,272 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,272 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,272 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,272 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,273 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,273 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-16 00:28:35,274 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,274 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,274 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,274 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,275 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,275 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,276 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-16 00:28:35,277 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,277 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,277 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,277 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,278 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,278 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,278 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,279 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-16 00:28:35,279 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,279 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,280 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,280 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,280 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,281 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-16 00:28:35,282 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,282 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,282 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,283 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,283 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,284 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-16 00:28:35,284 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,284 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:35,284 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,284 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,285 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,285 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:35,285 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:35,286 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,286 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-16 00:28:35,286 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,287 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,287 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,287 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,288 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,288 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,289 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,289 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-16 00:28:35,290 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,290 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,290 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,290 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,291 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,291 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,292 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-16 00:28:35,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,294 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,294 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,296 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,296 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-16 00:28:35,296 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,297 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,297 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,297 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,298 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,298 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,301 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,302 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-16 00:28:35,302 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,305 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-16 00:28:35,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,306 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,307 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,307 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,309 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-16 00:28:35,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,310 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,310 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,310 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,311 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,311 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,313 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,313 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-16 00:28:35,314 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,314 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,314 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,314 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,315 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,315 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,317 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-16 00:28:35,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,318 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,318 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,319 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,319 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:35,321 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-16 00:28:35,321 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:35,322 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:35,322 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:35,322 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:35,324 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:35,324 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:35,340 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:28:35,349 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:28:35,349 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:28:35,350 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:28:35,350 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:28:35,351 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:28:35,351 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2019-11-16 00:28:35,455 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2019-11-16 00:28:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:28:35,457 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:28:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:35,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:35,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:35,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:35,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:28:35,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:35,512 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-16 00:28:35,512 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-16 00:28:35,512 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-11-16 00:28:35,553 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 22 states and 27 transitions. Complement of second has 7 states. [2019-11-16 00:28:35,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-16 00:28:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:28:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-16 00:28:35,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-16 00:28:35,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:35,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-16 00:28:35,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:35,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2019-11-16 00:28:35,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:35,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2019-11-16 00:28:35,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:35,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2019-11-16 00:28:35,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-16 00:28:35,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-11-16 00:28:35,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2019-11-16 00:28:35,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:28:35,560 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2019-11-16 00:28:35,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2019-11-16 00:28:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-11-16 00:28:35,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-16 00:28:35,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2019-11-16 00:28:35,563 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:28:35,563 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2019-11-16 00:28:35,563 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:28:35,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2019-11-16 00:28:35,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-11-16 00:28:35,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:35,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:35,564 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:35,564 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-16 00:28:35,565 INFO L791 eck$LassoCheckResult]: Stem: 466#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 464#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 465#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 471#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 472#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 483#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 482#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 467#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 468#L558-4 [2019-11-16 00:28:35,565 INFO L793 eck$LassoCheckResult]: Loop: 468#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 478#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 479#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 475#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 476#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 468#L558-4 [2019-11-16 00:28:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:35,565 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2019-11-16 00:28:35,565 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:35,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596568435] [2019-11-16 00:28:35,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,566 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:35,619 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:35,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:35,620 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2019-11-16 00:28:35,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:35,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997283728] [2019-11-16 00:28:35,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:35,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:35,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2019-11-16 00:28:35,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:35,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119373011] [2019-11-16 00:28:35,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:35,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:35,714 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:36,834 WARN L191 SmtUtils]: Spent 1000.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 142 [2019-11-16 00:28:37,199 WARN L191 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2019-11-16 00:28:37,202 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:28:37,202 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:28:37,202 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:28:37,202 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:28:37,202 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:28:37,202 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:28:37,203 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:28:37,203 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:28:37,203 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca.i_Iteration4_Lasso [2019-11-16 00:28:37,203 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:28:37,203 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:28:37,207 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-16 00:28:37,209 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-16 00:28:37,211 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-16 00:28:37,213 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-16 00:28:37,214 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-16 00:28:37,216 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-16 00:28:37,218 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-16 00:28:37,219 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-16 00:28:37,222 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-16 00:28:37,923 WARN L191 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2019-11-16 00:28:38,081 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-16 00:28:38,082 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-16 00:28:38,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-16 00:28:38,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-16 00:28:38,087 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-16 00:28:38,089 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-16 00:28:38,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-16 00:28:38,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-16 00:28:38,457 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-16 00:28:39,713 WARN L191 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-16 00:28:39,751 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:28:39,751 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:28:39,751 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-16 00:28:39,752 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,752 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:39,752 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:39,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:39,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,754 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-16 00:28:39,754 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,755 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,755 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,755 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,755 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:39,755 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:39,757 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,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-16 00:28:39,758 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,758 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:39,758 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,758 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,758 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,758 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:39,758 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:39,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,759 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-16 00:28:39,760 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,760 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:39,760 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,760 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,760 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,760 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:39,760 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:39,762 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,763 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-16 00:28:39,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:39,764 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,764 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,764 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,764 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:39,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:39,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,765 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-16 00:28:39,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,767 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:39,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:39,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,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 [2019-11-16 00:28:39,770 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,770 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:28:39,771 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,771 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,771 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,771 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:28:39,772 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:28:39,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,772 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-16 00:28:39,773 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,773 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,773 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,773 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,774 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:39,774 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:39,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,776 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-16 00:28:39,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,777 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,777 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,778 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:39,778 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:39,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,782 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-16 00:28:39,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,783 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,783 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,784 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:39,784 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:39,786 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:28:39,786 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-16 00:28:39,787 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:28:39,787 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:28:39,787 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:28:39,787 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:28:39,790 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-16 00:28:39,790 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-16 00:28:39,806 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:28:39,819 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-16 00:28:39,819 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-16 00:28:39,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:28:39,820 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-16 00:28:39,821 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:28:39,821 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_3 Supporting invariants [] [2019-11-16 00:28:40,024 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2019-11-16 00:28:40,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:28:40,026 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-16 00:28:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:40,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:28:40,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:40,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-16 00:28:40,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:40,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:40,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 60 [2019-11-16 00:28:40,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:40,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:40,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:40,204 INFO L567 ElimStorePlain]: treesize reduction 52, result has 34.2 percent of original size [2019-11-16 00:28:40,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-16 00:28:40,204 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2019-11-16 00:28:40,326 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-16 00:28:40,326 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-11-16 00:28:40,326 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-16 00:28:40,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 59 states and 71 transitions. Complement of second has 13 states. [2019-11-16 00:28:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-11-16 00:28:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-16 00:28:40,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2019-11-16 00:28:40,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 5 letters. [2019-11-16 00:28:40,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:40,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 13 letters. Loop has 5 letters. [2019-11-16 00:28:40,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:40,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 8 letters. Loop has 10 letters. [2019-11-16 00:28:40,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:28:40,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 71 transitions. [2019-11-16 00:28:40,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-16 00:28:40,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 55 states and 67 transitions. [2019-11-16 00:28:40,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:28:40,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-16 00:28:40,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 67 transitions. [2019-11-16 00:28:40,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:28:40,543 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-11-16 00:28:40,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 67 transitions. [2019-11-16 00:28:40,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2019-11-16 00:28:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-16 00:28:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2019-11-16 00:28:40,548 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-16 00:28:40,548 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 60 transitions. [2019-11-16 00:28:40,548 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:28:40,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2019-11-16 00:28:40,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-11-16 00:28:40,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:28:40,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:28:40,551 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:28:40,551 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2019-11-16 00:28:40,551 INFO L791 eck$LassoCheckResult]: Stem: 785#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 783#L-1 havoc main_#res;havoc main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet13, main_#t~nondet14, main_#t~nondet15;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem10, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem11, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem12, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.allocOnStack(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.allocOnStack(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 784#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 811#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 810#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 809#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 808#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 805#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 804#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 798#L557-3 [2019-11-16 00:28:40,551 INFO L793 eck$LassoCheckResult]: Loop: 798#L557-3 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 830#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem7;havoc test_fun_#t~mem6; 829#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 828#L558-1 assume !!(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem10; 827#L558-3 call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 825#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 797#L558-4 call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem11; 798#L557-3 [2019-11-16 00:28:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1271620394, now seen corresponding path program 2 times [2019-11-16 00:28:40,552 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:40,552 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968752023] [2019-11-16 00:28:40,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:40,587 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:40,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2019-11-16 00:28:40,587 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:40,588 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870494458] [2019-11-16 00:28:40,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,588 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:28:40,598 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:28:40,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:40,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1864355357, now seen corresponding path program 3 times [2019-11-16 00:28:40,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:40,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875589738] [2019-11-16 00:28:40,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:40,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:40,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:41,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875589738] [2019-11-16 00:28:41,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660408570] [2019-11-16 00:28:41,020 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_718c18c9-497b-4349-812a-ac4194952041/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:41,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-16 00:28:41,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:28:41,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-16 00:28:41,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:41,126 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 8 [2019-11-16 00:28:41,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:41,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:41,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:41,133 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-16 00:28:41,223 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:41,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 65 [2019-11-16 00:28:41,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:28:41,268 INFO L567 ElimStorePlain]: treesize reduction 87, result has 31.5 percent of original size [2019-11-16 00:28:41,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:41,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:40 [2019-11-16 00:28:41,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,388 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:28:41,388 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 35 [2019-11-16 00:28:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:41,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-16 00:28:41,415 INFO L567 ElimStorePlain]: treesize reduction 17, result has 43.3 percent of original size [2019-11-16 00:28:41,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:28:41,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2019-11-16 00:28:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:28:41,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:41,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-16 00:28:41,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750254442] [2019-11-16 00:28:41,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:41,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:28:41,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:28:41,546 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. cyclomatic complexity: 18 Second operand 16 states. [2019-11-16 00:28:41,997 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-11-16 00:28:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:42,271 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2019-11-16 00:28:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:28:42,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2019-11-16 00:28:42,273 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:28:42,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 0 states and 0 transitions. [2019-11-16 00:28:42,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:28:42,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:28:42,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:28:42,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:28:42,274 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:42,274 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:42,274 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:42,274 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:28:42,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:28:42,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:28:42,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:28:42,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:28:42 BoogieIcfgContainer [2019-11-16 00:28:42,281 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:28:42,281 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:28:42,281 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:28:42,282 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:28:42,282 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:28:25" (3/4) ... [2019-11-16 00:28:42,285 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:28:42,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:28:42,287 INFO L168 Benchmark]: Toolchain (without parser) took 17647.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 292.0 MB). Free memory was 940.7 MB in the beginning and 1.3 GB in the end (delta: -331.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:42,287 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:42,288 INFO L168 Benchmark]: CACSL2BoogieTranslator took 620.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:42,289 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.63 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-16 00:28:42,289 INFO L168 Benchmark]: Boogie Preprocessor took 30.34 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:42,290 INFO L168 Benchmark]: RCFGBuilder took 377.22 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:28:42,290 INFO L168 Benchmark]: BuchiAutomizer took 16565.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -171.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:42,291 INFO L168 Benchmark]: Witness Printer took 4.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:28:42,293 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 620.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -181.8 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.63 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 30.34 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 377.22 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16565.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 152.0 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -171.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 - 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 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] + -1 * unknown-#memory_int-unknown[y_ref][y_ref] and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 14.7s. Construction of modules took 0.2s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 33 SDslu, 13 SDs, 0 SdLazy, 173 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital888 mio100 ax102 hnf100 lsp96 ukn32 mio100 lsp31 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf729 smp90 tf100 neg91 sie127 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 140ms VariablesStem: 9 VariablesLoop: 6 DisjunctsStem: 16 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 36 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...