./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a398041f87cd84898ae142142fdf4872d746c3b1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:53,304 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:53,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:53,328 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:53,328 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:53,329 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:53,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:53,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:53,340 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:53,341 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:53,342 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:53,342 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:53,345 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:53,346 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:53,347 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:53,348 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:53,349 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:53,350 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:53,352 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:53,354 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:53,355 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:53,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:53,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:53,359 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:53,359 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:53,360 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:53,361 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:53,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:53,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:53,364 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:53,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:53,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:53,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:53,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:53,367 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:53,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:53,372 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:53,401 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:53,402 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:53,403 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:53,404 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:53,404 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:53,404 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:53,404 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:53,404 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:53,405 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:53,406 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:53,406 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:53,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:53,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:53,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:53,407 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:53,407 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:53,407 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:53,407 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:53,408 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:53,408 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:53,408 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:53,408 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:53,408 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:53,408 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:53,409 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:53,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:53,409 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:53,409 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:53,410 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:53,410 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a398041f87cd84898ae142142fdf4872d746c3b1 [2018-11-28 23:19:53,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:53,473 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:53,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:53,479 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:53,479 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:53,480 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:53,543 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0fa6cc9/a6bc21b7085449e98df8158f43532aaa/FLAG2a86b4df8 [2018-11-28 23:19:54,081 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:54,082 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:54,095 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0fa6cc9/a6bc21b7085449e98df8158f43532aaa/FLAG2a86b4df8 [2018-11-28 23:19:54,372 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0fa6cc9/a6bc21b7085449e98df8158f43532aaa [2018-11-28 23:19:54,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:54,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:54,382 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:54,382 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:54,386 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:54,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:54,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d80e72b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54, skipping insertion in model container [2018-11-28 23:19:54,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:54,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:54,441 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:54,749 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:54,769 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:54,851 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:54,919 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:54,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54 WrapperNode [2018-11-28 23:19:54,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:54,920 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:54,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:54,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:54,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:55,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:55,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:55,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:55,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,107 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... [2018-11-28 23:19:55,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:55,119 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:55,120 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:55,120 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:55,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:55,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:55,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:55,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:55,631 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:55,631 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:19:55,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:55 BoogieIcfgContainer [2018-11-28 23:19:55,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:55,633 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:55,633 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:55,638 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:55,639 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:55,641 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:54" (1/3) ... [2018-11-28 23:19:55,642 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13e10f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:55, skipping insertion in model container [2018-11-28 23:19:55,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:55,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:54" (2/3) ... [2018-11-28 23:19:55,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13e10f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:55, skipping insertion in model container [2018-11-28 23:19:55,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:55,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:55" (3/3) ... [2018-11-28 23:19:55,648 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.17-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:19:55,720 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:55,721 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:55,721 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:55,721 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:55,722 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:55,722 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:55,722 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:55,722 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:55,722 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:55,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:55,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:55,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:55,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:55,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:55,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:55,771 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:55,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-28 23:19:55,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:55,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:55,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:55,773 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:55,773 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:55,782 INFO L794 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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-11-28 23:19:55,783 INFO L796 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~mem6;havoc test_fun_#t~mem7; 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 [2018-11-28 23:19:55,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:55,792 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:19:55,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:55,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:55,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:56,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2018-11-28 23:19:56,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:56,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:56,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:56,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:56,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:56,062 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:56,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:56,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:56,085 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2018-11-28 23:19:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:56,100 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-11-28 23:19:56,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:56,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 23:19:56,105 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:56,110 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 7 states and 8 transitions. [2018-11-28 23:19:56,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:19:56,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:19:56,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-28 23:19:56,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:56,114 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:56,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-28 23:19:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:19:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:19:56,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-11-28 23:19:56,148 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:56,148 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-28 23:19:56,148 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:56,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2018-11-28 23:19:56,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:19:56,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:56,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:56,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:19:56,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:56,153 INFO L794 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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-11-28 23:19:56,153 INFO L796 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~mem6;havoc test_fun_#t~mem7; 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 [2018-11-28 23:19:56,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:56,154 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:19:56,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:56,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:56,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:56,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:56,230 INFO L82 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2018-11-28 23:19:56,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:56,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:56,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:56,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:56,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907759, now seen corresponding path program 1 times [2018-11-28 23:19:56,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:56,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:56,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:56,596 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 23:19:56,771 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 23:19:58,006 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-28 23:19:58,481 WARN L180 SmtUtils]: Spent 472.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-28 23:19:58,495 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:58,496 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:58,496 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:58,496 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:58,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:58,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:58,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:58,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:58,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-28 23:19:58,498 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:58,498 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:58,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:58,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,423 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 91 [2018-11-28 23:19:59,750 WARN L180 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-11-28 23:19:59,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:59,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:00,866 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:20:00,926 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:00,931 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:00,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:00,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:00,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:00,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:00,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:00,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:00,939 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:00,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:00,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:00,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:00,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:00,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:00,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:00,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:00,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:00,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:00,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:00,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:00,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:00,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:00,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:00,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:00,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:00,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:00,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:00,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:00,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:00,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:00,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:00,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:00,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:00,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:00,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:00,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:00,968 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:00,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:00,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:00,969 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:00,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:00,973 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:00,973 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:00,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:00,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:00,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:00,979 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:00,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:00,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:00,983 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:00,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:00,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,002 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,005 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,069 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:01,069 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,073 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:01,073 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,087 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,087 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,093 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:01,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,097 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:01,097 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,106 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:01,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,111 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:01,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,130 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,131 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,134 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,139 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,152 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,152 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:01,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:01,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:01,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:01,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:01,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:01,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:01,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:01,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:01,236 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:01,241 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:20:01,244 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:01,246 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:01,248 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:01,249 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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 [] [2018-11-28 23:20:01,608 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-28 23:20:01,629 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:01,630 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:01,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:01,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:01,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:01,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:01,967 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 [2018-11-28 23:20:01,968 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-28 23:20:02,271 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand 6 states. Result 17 states and 20 transitions. Complement of second has 11 states. [2018-11-28 23:20:02,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:20:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 23:20:02,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-28 23:20:02,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:02,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-28 23:20:02,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:02,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-28 23:20:02,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:02,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 20 transitions. [2018-11-28 23:20:02,279 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:02,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 19 transitions. [2018-11-28 23:20:02,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:20:02,282 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:20:02,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-28 23:20:02,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:02,282 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:20:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-28 23:20:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:20:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:20:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-28 23:20:02,286 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:20:02,286 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-28 23:20:02,286 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:20:02,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-28 23:20:02,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:02,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:02,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:02,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:02,290 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:20:02,290 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 260#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.alloc(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.alloc(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.alloc(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.alloc(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); 261#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); 274#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 275#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); 263#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; 264#L558-3 [2018-11-28 23:20:02,290 INFO L796 eck$LassoCheckResult]: Loop: 264#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); 270#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; 264#L558-3 [2018-11-28 23:20:02,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,291 INFO L82 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2018-11-28 23:20:02,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:02,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2018-11-28 23:20:02,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:02,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,364 INFO L82 PathProgramCache]: Analyzing trace with hash 179567346, now seen corresponding path program 2 times [2018-11-28 23:20:02,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:02,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,645 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-28 23:20:03,287 WARN L180 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2018-11-28 23:20:03,653 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-28 23:20:03,657 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:03,657 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:03,657 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:03,657 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:03,657 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:03,657 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:03,658 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:03,658 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:03,658 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 23:20:03,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:03,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:03,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:03,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,165 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 92 [2018-11-28 23:20:04,306 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-28 23:20:04,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:04,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:05,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:05,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:05,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:05,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:05,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:05,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:05,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:05,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:05,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,189 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,204 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,205 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:05,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,209 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:05,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,225 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,225 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,231 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:05,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,232 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:05,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,238 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:05,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:05,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:05,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:05,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:05,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:05,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:05,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:05,283 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:05,294 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:05,294 INFO L444 ModelExtractionUtils]: 36 out of 40 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:20:05,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:05,297 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:05,297 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:05,298 INFO L520 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 [] [2018-11-28 23:20:05,953 INFO L297 tatePredicateManager]: 32 out of 32 supporting invariants were superfluous and have been removed [2018-11-28 23:20:05,955 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:05,956 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:05,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:06,174 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 [2018-11-28 23:20:06,174 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:20:06,197 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. [2018-11-28 23:20:06,199 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 [2018-11-28 23:20:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:20:06,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:20:06,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:20:06,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:20:06,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:20:06,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-28 23:20:06,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:06,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 26 transitions. [2018-11-28 23:20:06,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:20:06,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:20:06,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 26 transitions. [2018-11-28 23:20:06,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:06,205 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-28 23:20:06,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 26 transitions. [2018-11-28 23:20:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-28 23:20:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:20:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2018-11-28 23:20:06,208 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:20:06,208 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2018-11-28 23:20:06,208 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:20:06,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 25 transitions. [2018-11-28 23:20:06,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:06,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:06,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:06,209 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:06,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:06,210 INFO L794 eck$LassoCheckResult]: Stem: 476#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 474#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.alloc(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.alloc(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.alloc(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.alloc(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); 475#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); 489#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 493#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); 492#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; 491#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); 477#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 478#L558-4 [2018-11-28 23:20:06,210 INFO L796 eck$LassoCheckResult]: Loop: 478#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; 486#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); 481#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 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); 485#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 478#L558-4 [2018-11-28 23:20:06,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash 179567344, now seen corresponding path program 1 times [2018-11-28 23:20:06,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:06,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 2 times [2018-11-28 23:20:06,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash -474670094, now seen corresponding path program 1 times [2018-11-28 23:20:06,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:06,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,682 WARN L180 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-28 23:20:07,703 WARN L180 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 137 [2018-11-28 23:20:08,054 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-11-28 23:20:08,061 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:08,061 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:08,061 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:08,061 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:08,062 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:08,062 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:08,062 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:08,062 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:08,062 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.17-alloca_true-termination_true-no-overflow.c.i_Iteration4_Lasso [2018-11-28 23:20:08,062 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:08,062 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:08,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:08,852 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 101 [2018-11-28 23:20:09,052 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-11-28 23:20:09,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:20:09,443 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2018-11-28 23:20:10,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:10,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:10,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,050 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,057 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,063 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,068 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,071 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,071 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,071 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,071 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,075 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,086 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,105 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:10,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:10,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:10,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,125 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:10,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,130 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:10,130 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,149 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,154 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:10,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,160 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:10,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:10,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:20:10,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:10,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:10,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:10,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:10,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:10,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:10,194 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:10,212 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:20:10,212 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:20:10,213 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:10,213 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:10,214 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:10,215 INFO L520 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)_3, 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 Supporting invariants [] [2018-11-28 23:20:10,545 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-28 23:20:10,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:10,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:10,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:10,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:10,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:10,628 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:10,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2018-11-28 23:20:10,690 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:10,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 43 [2018-11-28 23:20:10,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-28 23:20:10,758 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:10,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 23:20:10,760 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:10,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:10,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:10,784 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:31, output treesize:26 [2018-11-28 23:20:10,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:10,847 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:20:10,847 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8 Second operand 5 states. [2018-11-28 23:20:10,896 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 25 transitions. cyclomatic complexity: 8. Second operand 5 states. Result 48 states and 58 transitions. Complement of second has 9 states. [2018-11-28 23:20:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 23:20:10,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-28 23:20:10,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:10,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 13 letters. Loop has 5 letters. [2018-11-28 23:20:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:10,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 8 letters. Loop has 10 letters. [2018-11-28 23:20:10,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:10,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-11-28 23:20:10,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:10,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 46 transitions. [2018-11-28 23:20:10,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:20:10,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 23:20:10,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 46 transitions. [2018-11-28 23:20:10,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:10,904 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-28 23:20:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 46 transitions. [2018-11-28 23:20:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2018-11-28 23:20:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:20:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2018-11-28 23:20:10,909 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-28 23:20:10,909 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-28 23:20:10,909 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:20:10,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 42 transitions. [2018-11-28 23:20:10,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:20:10,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:10,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:10,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:20:10,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:10,912 INFO L794 eck$LassoCheckResult]: Stem: 776#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 774#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.alloc(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.alloc(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.alloc(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.alloc(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); 775#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); 783#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 784#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); 779#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 780#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; 790#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); 781#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 782#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); 777#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; 778#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); 791#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 792#L558-4 [2018-11-28 23:20:10,912 INFO L796 eck$LassoCheckResult]: Loop: 792#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; 785#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); 786#L557-1 assume !!(test_fun_#t~mem6 > test_fun_#t~mem7);havoc test_fun_#t~mem6;havoc test_fun_#t~mem7; 800#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); 801#L558-1 assume !(test_fun_#t~mem8 > test_fun_#t~mem9);havoc test_fun_#t~mem9;havoc test_fun_#t~mem8; 792#L558-4 [2018-11-28 23:20:10,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:10,913 INFO L82 PathProgramCache]: Analyzing trace with hash -652525668, now seen corresponding path program 2 times [2018-11-28 23:20:10,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:10,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:10,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:10,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:10,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:11,256 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-11-28 23:20:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:11,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:11,662 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:11,672 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:20:11,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:20:11,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:20:11,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:11,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-28 23:20:11,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-28 23:20:11,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-28 23:20:12,128 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:20:12,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:12,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-11-28 23:20:12,201 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:12,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-28 23:20:12,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-28 23:20:12,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-28 23:20:12,270 INFO L478 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 13 treesize of output 9 [2018-11-28 23:20:12,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,282 INFO L478 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 11 treesize of output 7 [2018-11-28 23:20:12,283 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:12,296 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-28 23:20:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:12,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:12,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2018-11-28 23:20:12,332 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:20:12,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:12,333 INFO L82 PathProgramCache]: Analyzing trace with hash 52861313, now seen corresponding path program 3 times [2018-11-28 23:20:12,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:12,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:12,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:20:12,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:20:12,460 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. cyclomatic complexity: 13 Second operand 14 states. [2018-11-28 23:20:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:12,819 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-28 23:20:12,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:20:12,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-28 23:20:12,822 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:12,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-28 23:20:12,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:12,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:12,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:12,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:12,822 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:12,823 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:12,823 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:12,823 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:20:12,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:12,823 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:12,823 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:12,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:12 BoogieIcfgContainer [2018-11-28 23:20:12,831 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:12,832 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:12,832 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:12,832 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:12,833 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:55" (3/4) ... [2018-11-28 23:20:12,840 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:12,841 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:12,841 INFO L168 Benchmark]: Toolchain (without parser) took 18463.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -66.7 MB). Peak memory consumption was 210.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:12,844 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:12,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 538.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:12,846 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:12,847 INFO L168 Benchmark]: Boogie Preprocessor took 57.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:12,848 INFO L168 Benchmark]: RCFGBuilder took 512.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:12,848 INFO L168 Benchmark]: BuchiAutomizer took 17198.97 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.3 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:12,850 INFO L168 Benchmark]: Witness Printer took 8.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:12,861 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 538.43 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 929.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 97.0 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 512.68 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17198.97 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.3 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. * Witness Printer took 8.68 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 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[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 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 -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.1s and 6 iterations. TraceHistogramMax:3. Analysis of lassos took 15.3s. 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, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 33 SDtfs, 25 SDslu, 10 SDs, 0 SdLazy, 127 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital876 mio100 ax102 hnf100 lsp96 ukn31 mio100 lsp33 div100 bol100 ite100 ukn100 eq194 hnf87 smp99 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...