./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-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/c.01_assume-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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20:00,332 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:20:00,334 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:20:00,351 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:20:00,352 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:20:00,353 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:20:00,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:20:00,359 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:20:00,361 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:20:00,365 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:20:00,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:20:00,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:20:00,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:20:00,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:20:00,380 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:20:00,381 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:20:00,382 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:20:00,383 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:20:00,385 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:20:00,387 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:20:00,388 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:20:00,389 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:20:00,391 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:20:00,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:20:00,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:20:00,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:20:00,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:20:00,395 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:20:00,396 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:20:00,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:20:00,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:20:00,398 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:20:00,399 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:20:00,399 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:20:00,400 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:20:00,401 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:20:00,401 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:20:00,429 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:20:00,430 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:20:00,431 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:20:00,432 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:20:00,432 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:20:00,432 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:20:00,432 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:20:00,432 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:20:00,432 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:20:00,433 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:20:00,434 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:20:00,434 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:20:00,434 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:20:00,434 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:20:00,434 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:20:00,435 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:20:00,435 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:20:00,435 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:20:00,435 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:20:00,435 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:20:00,435 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:20:00,436 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:20:00,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:20:00,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:20:00,437 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:20:00,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:20:00,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:20:00,438 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:20:00,439 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:20:00,439 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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2018-11-28 23:20:00,492 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:20:00,509 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:20:00,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:20:00,519 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:20:00,519 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:20:00,520 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:20:00,579 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b98acda7/462a8c8e0e8645619c75ad87f0ed6d3d/FLAG0c96a153f [2018-11-28 23:20:01,138 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:20:01,139 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:20:01,155 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b98acda7/462a8c8e0e8645619c75ad87f0ed6d3d/FLAG0c96a153f [2018-11-28 23:20:01,426 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b98acda7/462a8c8e0e8645619c75ad87f0ed6d3d [2018-11-28 23:20:01,429 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:20:01,431 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:20:01,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:01,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:20:01,436 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:20:01,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:01" (1/1) ... [2018-11-28 23:20:01,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4125e4cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:01, skipping insertion in model container [2018-11-28 23:20:01,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:20:01" (1/1) ... [2018-11-28 23:20:01,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:20:01,489 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:20:01,870 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:01,885 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:20:01,929 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:20:02,000 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:20:02,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02 WrapperNode [2018-11-28 23:20:02,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:20:02,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:02,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:20:02,003 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:20:02,013 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:20:02" (1/1) ... [2018-11-28 23:20:02,111 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:20:02" (1/1) ... [2018-11-28 23:20:02,134 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:20:02,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:20:02,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:20:02,135 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:20:02,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,150 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,162 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... [2018-11-28 23:20:02,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:20:02,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:20:02,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:20:02,176 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:20:02,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:20:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:20:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:20:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:20:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:20:02,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:20:02,672 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:20:02,673 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:20:02,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:02 BoogieIcfgContainer [2018-11-28 23:20:02,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:20:02,674 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:20:02,674 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:20:02,678 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:20:02,679 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:02,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:20:01" (1/3) ... [2018-11-28 23:20:02,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@472305a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:02, skipping insertion in model container [2018-11-28 23:20:02,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:02,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:20:02" (2/3) ... [2018-11-28 23:20:02,684 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@472305a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:20:02, skipping insertion in model container [2018-11-28 23:20:02,684 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:20:02,684 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:02" (3/3) ... [2018-11-28 23:20:02,689 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-11-28 23:20:02,752 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:20:02,753 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:20:02,753 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:20:02,754 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:20:02,754 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:20:02,754 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:20:02,754 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:20:02,754 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:20:02,754 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:20:02,770 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:20:02,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:02,791 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:02,791 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:02,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:20:02,798 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:02,798 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:20:02,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:20:02,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:02,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:02,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:02,800 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:20:02,801 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:02,810 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 12#L553-3true [2018-11-28 23:20:02,810 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2018-11-28 23:20:02,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-28 23:20:02,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:02,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2018-11-28 23:20:02,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:02,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:02,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:03,007 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:03,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:20:03,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:20:03,014 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:20:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:20:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:20:03,032 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-28 23:20:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:03,039 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-28 23:20:03,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:20:03,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 23:20:03,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:03,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2018-11-28 23:20:03,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:20:03,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:20:03,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-28 23:20:03,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:03,050 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:20:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-28 23:20:03,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-28 23:20:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:20:03,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-28 23:20:03,081 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:20:03,081 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-28 23:20:03,081 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:20:03,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-28 23:20:03,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:20:03,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:03,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:03,083 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:20:03,083 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:03,083 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 37#L553-3 [2018-11-28 23:20:03,083 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2018-11-28 23:20:03,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-28 23:20:03,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2018-11-28 23:20:03,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:03,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:03,282 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:03,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:20:03,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 23:20:03,283 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:20:03,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:20:03,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:20:03,283 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-11-28 23:20:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:03,564 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-11-28 23:20:03,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:20:03,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-11-28 23:20:03,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-11-28 23:20:03,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-11-28 23:20:03,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:20:03,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:20:03,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-11-28 23:20:03,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:03,570 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-11-28 23:20:03,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-11-28 23:20:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-11-28 23:20:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-28 23:20:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-28 23:20:03,575 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-28 23:20:03,575 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-28 23:20:03,575 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:20:03,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-28 23:20:03,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:20:03,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:03,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:03,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:20:03,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:20:03,578 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 73#L553-3 [2018-11-28 23:20:03,579 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2018-11-28 23:20:03,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,579 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-28 23:20:03,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:03,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2018-11-28 23:20:03,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:03,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2018-11-28 23:20:03,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:03,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:03,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:03,974 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-11-28 23:20:04,442 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2018-11-28 23:20:04,804 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:20:04,820 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:04,821 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:04,821 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:04,821 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:04,822 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:04,822 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:04,822 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:04,822 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:04,822 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-28 23:20:04,822 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:04,823 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:04,847 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,853 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,859 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,862 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,865 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,869 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,877 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,881 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,889 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,898 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,900 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,908 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,910 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,914 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,917 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,182 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-11-28 23:20:05,361 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2018-11-28 23:20:05,362 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,395 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,402 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,409 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:06,007 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:06,013 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:06,016 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:06,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,027 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:06,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,033 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:06,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,039 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:06,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,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:06,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,050 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:06,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,060 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:06,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,066 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:06,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,072 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:06,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,078 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,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:06,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,087 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,087 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,090 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:06,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,095 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,095 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,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:06,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,105 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:06,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,111 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:06,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:06,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:06,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:06,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,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:06,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,118 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:06,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,123 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:06,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,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:06,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,135 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,156 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:06,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,166 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,186 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:06,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,191 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,201 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:06,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,209 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:06,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,210 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:06,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,214 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:06,214 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:06,225 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:06,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:06,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:06,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:06,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:06,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:06,231 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:06,243 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:06,253 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:20:06,253 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:20:06,256 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:06,258 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:06,258 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:06,259 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-11-28 23:20:06,371 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:20:06,381 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:06,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:06,533 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-28 23:20:06,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:20:06,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:06,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:06,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:06,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-11-28 23:20:06,644 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,650 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:20:06,651 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:20:06,853 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2018-11-28 23:20:06,855 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:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:20:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-28 23:20:06,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:20:06,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:20:06,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-11-28 23:20:06,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:06,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-28 23:20:06,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:20:06,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2018-11-28 23:20:06,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:20:06,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:20:06,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2018-11-28 23:20:06,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:06,865 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-11-28 23:20:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2018-11-28 23:20:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-28 23:20:06,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:20:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-11-28 23:20:06,869 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-28 23:20:06,869 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-11-28 23:20:06,869 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:20:06,869 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-11-28 23:20:06,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:20:06,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:06,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:06,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:20:06,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:06,871 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-11-28 23:20:06,871 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-11-28 23:20:06,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,872 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:20:06,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:06,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:06,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:06,892 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2018-11-28 23:20:06,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:06,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:06,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:06,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:06,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:06,989 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:07,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:07,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:07,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:20:07,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:20:07,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 23:20:07,075 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-11-28 23:20:07,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:07,088 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-28 23:20:07,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:07,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-28 23:20:07,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:07,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:07,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-11-28 23:20:07,191 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:20:07,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:20:07,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:20:07,192 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-11-28 23:20:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:07,466 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-28 23:20:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:20:07,467 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2018-11-28 23:20:07,470 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-11-28 23:20:07,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2018-11-28 23:20:07,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 23:20:07,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 23:20:07,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-11-28 23:20:07,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:07,497 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-28 23:20:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-11-28 23:20:07,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-11-28 23:20:07,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:20:07,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-11-28 23:20:07,505 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-11-28 23:20:07,505 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-11-28 23:20:07,505 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:20:07,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2018-11-28 23:20:07,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 23:20:07,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:07,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:07,509 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:20:07,509 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:07,509 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-11-28 23:20:07,510 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-11-28 23:20:07,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 23:20:07,514 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:07,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:07,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:07,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2018-11-28 23:20:07,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:07,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:07,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:07,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2018-11-28 23:20:07,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:07,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:07,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:07,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:08,013 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-11-28 23:20:08,391 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 23:20:08,550 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-28 23:20:08,554 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:08,554 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:08,555 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:08,555 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:08,555 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:08,555 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:08,555 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:08,555 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:08,555 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-28 23:20:08,555 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:08,555 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:08,560 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,589 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,590 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,596 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,599 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,601 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,616 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,618 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,620 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,623 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,628 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,632 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,835 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2018-11-28 23:20:08,975 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2018-11-28 23:20:08,976 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,980 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,982 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,984 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,986 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,990 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,992 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,417 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:09,418 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:09,418 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:09,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,424 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:09,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,429 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:09,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,433 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:09,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,435 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:09,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,437 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:09,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,438 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,440 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:09,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,444 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:09,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,446 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,448 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:09,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,451 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:09,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,452 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,453 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:09,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:09,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:09,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:09,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,456 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:09,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,472 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:09,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,480 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:09,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,483 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,490 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:09,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,498 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:09,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,498 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:09,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,499 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:09,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:09,505 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:09,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:09,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:09,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:09,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:09,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:09,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:09,526 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:09,546 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:20:09,546 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:20:09,546 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:09,550 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:09,550 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:09,550 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-28 23:20:09,854 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:20:09,864 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:10,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:10,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:10,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:10,350 INFO L303 Elim1Store]: Index analysis took 138 ms [2018-11-28 23:20:10,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-28 23:20:10,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-11-28 23:20:10,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:10,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-11-28 23:20:10,647 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-28 23:20:10,664 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,680 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,681 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:30 [2018-11-28 23:20:10,913 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-11-28 23:20:10,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,127 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 52 treesize of output 64 [2018-11-28 23:20:11,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,165 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2018-11-28 23:20:11,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-11-28 23:20:11,339 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:11,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:11,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:52, output treesize:56 [2018-11-28 23:20:11,603 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2018-11-28 23:20:11,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-28 23:20:11,700 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,702 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 42 treesize of output 29 [2018-11-28 23:20:11,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,721 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,756 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 49 [2018-11-28 23:20:11,767 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:20:11,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:11,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-11-28 23:20:11,771 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,782 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:11,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-28 23:20:11,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:60 [2018-11-28 23:20:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:11,897 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-28 23:20:11,898 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2018-11-28 23:20:12,382 WARN L180 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2018-11-28 23:20:12,550 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2018-11-28 23:20:12,645 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2018-11-28 23:20:12,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:20:12,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-11-28 23:20:12,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-28 23:20:12,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:12,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2018-11-28 23:20:12,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:12,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2018-11-28 23:20:12,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:12,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2018-11-28 23:20:12,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-11-28 23:20:12,656 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2018-11-28 23:20:12,656 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-28 23:20:12,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-11-28 23:20:12,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2018-11-28 23:20:12,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:12,657 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2018-11-28 23:20:12,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2018-11-28 23:20:12,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-11-28 23:20:12,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-28 23:20:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2018-11-28 23:20:12,667 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-11-28 23:20:12,667 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-11-28 23:20:12,667 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:20:12,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2018-11-28 23:20:12,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-11-28 23:20:12,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:12,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:12,672 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:20:12,672 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-11-28 23:20:12,673 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-11-28 23:20:12,673 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-11-28 23:20:12,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:12,673 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:20:12,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:12,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:12,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2018-11-28 23:20:12,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:12,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:12,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:12,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:12,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:12,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2018-11-28 23:20:12,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:12,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:12,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:13,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:13,152 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:13,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:13,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:13,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:20:13,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:20:13,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 23:20:13,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:13,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-11-28 23:20:13,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:13,384 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-28 23:20:13,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-28 23:20:13,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:13,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-11-28 23:20:13,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:13,535 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-11-28 23:20:13,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:13,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-11-28 23:20:13,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:13,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:13,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-11-28 23:20:14,082 WARN L180 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2018-11-28 23:20:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 23:20:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-11-28 23:20:14,124 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2018-11-28 23:20:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:14,276 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2018-11-28 23:20:14,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 23:20:14,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2018-11-28 23:20:14,280 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-28 23:20:14,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2018-11-28 23:20:14,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-11-28 23:20:14,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-28 23:20:14,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2018-11-28 23:20:14,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:14,285 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2018-11-28 23:20:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2018-11-28 23:20:14,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-11-28 23:20:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-28 23:20:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-11-28 23:20:14,298 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-11-28 23:20:14,298 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-11-28 23:20:14,298 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:20:14,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2018-11-28 23:20:14,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-11-28 23:20:14,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:14,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:14,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:20:14,301 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:20:14,302 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-11-28 23:20:14,302 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-11-28 23:20:14,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-11-28 23:20:14,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:14,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:14,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:14,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:14,330 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2018-11-28 23:20:14,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:14,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:14,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:14,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:14,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:14,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2018-11-28 23:20:14,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:14,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:14,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:14,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:14,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:15,433 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2018-11-28 23:20:15,785 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-11-28 23:20:15,863 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:15,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:15,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:15,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:15,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:15,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:15,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:15,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:15,864 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-11-28 23:20:15,864 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:15,864 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:15,868 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:15,899 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:15,917 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:15,918 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:15,923 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:15,925 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:15,926 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:16,152 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-11-28 23:20:16,286 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-11-28 23:20:16,286 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:16,290 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:16,292 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:16,294 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:16,296 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:16,298 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:16,300 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:16,307 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:16,309 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:16,311 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:16,313 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:16,314 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:16,315 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:16,727 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:16,728 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:16,728 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:16,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:16,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:16,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:16,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,738 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:16,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:16,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:16,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:16,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,744 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:16,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:16,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:16,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:16,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,750 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:16,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:16,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:16,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,759 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:16,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:16,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:16,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:16,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,765 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:16,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:16,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:16,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:16,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,771 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:16,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:16,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:16,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,779 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:16,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,784 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:16,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,791 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:16,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:16,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:16,798 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:16,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:16,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:16,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:16,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:16,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:16,802 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:16,825 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:16,848 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:20:16,848 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:20:16,848 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:16,849 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:20:16,850 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:16,851 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 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:17,086 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:20:17,088 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:17,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:17,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:17,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:17,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,210 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 45 treesize of output 59 [2018-11-28 23:20:17,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,223 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-11-28 23:20:17,228 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:17,281 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,283 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 40 treesize of output 39 [2018-11-28 23:20:17,285 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:17,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 23:20:17,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 23:20:17,406 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-11-28 23:20:17,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 52 [2018-11-28 23:20:17,556 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-28 23:20:17,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:17,582 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:17,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-28 23:20:17,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,638 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 23:20:17,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:17,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:17,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:20:17,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-28 23:20:17,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 52 [2018-11-28 23:20:17,992 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:17,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-28 23:20:17,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:18,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-11-28 23:20:18,102 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:18,103 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 35 treesize of output 24 [2018-11-28 23:20:18,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:18,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:20:18,166 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-28 23:20:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:18,221 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:20:18,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-11-28 23:20:20,194 WARN L180 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-11-28 23:20:20,483 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2018-11-28 23:20:21,876 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2018-11-28 23:20:23,551 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-11-28 23:20:23,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2018-11-28 23:20:23,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:23,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:20:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-11-28 23:20:23,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-28 23:20:23,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:23,647 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:23,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:23,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:23,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:23,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:23,877 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 45 treesize of output 59 [2018-11-28 23:20:23,887 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:23,889 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 50 treesize of output 39 [2018-11-28 23:20:23,890 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:23,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:23,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:23,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:23,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-11-28 23:20:23,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:24,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 23:20:24,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 23:20:24,047 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-11-28 23:20:24,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 52 [2018-11-28 23:20:24,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-11-28 23:20:24,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,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:24,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-28 23:20:24,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,265 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-28 23:20:24,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,282 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:20:24,314 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-28 23:20:24,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 53 treesize of output 52 [2018-11-28 23:20:24,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-11-28 23:20:24,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,563 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-11-28 23:20:24,572 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:24,573 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 35 treesize of output 24 [2018-11-28 23:20:24,574 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,583 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:24,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-28 23:20:24,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-11-28 23:20:24,743 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-11-28 23:20:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:20:24,747 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:20:24,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-11-28 23:20:25,669 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-11-28 23:20:26,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 353 states and 447 transitions. Complement of second has 29 states. [2018-11-28 23:20:26,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-11-28 23:20:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:20:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2018-11-28 23:20:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 14 letters. [2018-11-28 23:20:26,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 18 letters. Loop has 14 letters. [2018-11-28 23:20:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:26,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 28 letters. [2018-11-28 23:20:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:26,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 447 transitions. [2018-11-28 23:20:26,499 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-11-28 23:20:26,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 286 states and 366 transitions. [2018-11-28 23:20:26,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-11-28 23:20:26,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-11-28 23:20:26,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 366 transitions. [2018-11-28 23:20:26,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:26,511 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 366 transitions. [2018-11-28 23:20:26,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 366 transitions. [2018-11-28 23:20:26,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 233. [2018-11-28 23:20:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-11-28 23:20:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2018-11-28 23:20:26,531 INFO L728 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-11-28 23:20:26,531 INFO L608 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-11-28 23:20:26,532 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:20:26,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2018-11-28 23:20:26,540 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-28 23:20:26,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:26,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:26,541 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:20:26,541 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:26,541 INFO L794 eck$LassoCheckResult]: Stem: 1944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1942#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 1943#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1945#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1946#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-11-28 23:20:26,542 INFO L796 eck$LassoCheckResult]: Loop: 1959#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1950#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1951#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1954#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-11-28 23:20:26,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:26,542 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-11-28 23:20:26,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:26,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:26,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:26,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:26,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:26,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2018-11-28 23:20:26,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:26,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:26,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:26,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:26,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:26,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:26,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2018-11-28 23:20:26,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:26,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:26,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:26,853 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-11-28 23:20:27,225 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-11-28 23:20:27,773 WARN L180 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-11-28 23:20:27,776 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:27,776 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:27,776 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:27,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:27,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:27,777 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:27,777 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:27,777 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:27,777 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-11-28 23:20:27,777 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:27,777 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:27,786 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:27,813 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:27,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:20:27,816 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:27,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:20:27,819 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:27,827 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:27,828 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:27,830 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:28,350 WARN L180 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-11-28 23:20:28,476 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 23:20:28,477 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:28,480 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:28,482 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:28,485 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:28,487 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:28,489 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:28,491 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:29,120 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2018-11-28 23:20:29,284 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-28 23:20:29,355 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:29,356 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:29,356 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:29,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:29,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:29,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:29,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,363 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:29,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:29,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:29,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,369 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:29,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:29,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,373 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:29,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:29,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,374 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:29,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:29,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:29,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:29,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,380 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:29,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:29,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:29,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,382 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:29,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:29,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:29,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:29,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,387 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:29,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:29,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:29,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:29,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,393 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:29,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:29,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:29,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,402 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:29,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,402 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:29,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,403 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:29,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:29,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,410 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:29,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:29,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:29,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,433 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:29,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:29,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:29,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:29,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:29,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:29,436 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:29,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:29,439 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:29,439 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:20:29,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:29,462 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-28 23:20:29,462 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:20:29,610 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:29,697 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:20:29,698 INFO L444 ModelExtractionUtils]: 40 out of 46 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:20:29,699 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:29,701 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:20:29,701 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:29,702 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)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2018-11-28 23:20:29,990 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:20:30,006 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:30,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:30,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:30,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:30,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:30,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 42 [2018-11-28 23:20:30,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:30,382 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 42 treesize of output 29 [2018-11-28 23:20:30,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:30,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:30,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:30,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-28 23:20:30,413 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:30,414 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:30,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2018-11-28 23:20:30,455 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2018-11-28 23:20:30,460 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:30,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 23:20:30,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:20:30,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:30,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:20:30,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:30,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2018-11-28 23:20:30,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:30,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2018-11-28 23:20:30,469 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-28 23:20:30,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2018-11-28 23:20:30,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-28 23:20:30,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-28 23:20:30,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2018-11-28 23:20:30,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:30,473 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2018-11-28 23:20:30,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2018-11-28 23:20:30,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2018-11-28 23:20:30,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-11-28 23:20:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2018-11-28 23:20:30,484 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-11-28 23:20:30,484 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-11-28 23:20:30,484 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:20:30,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2018-11-28 23:20:30,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-28 23:20:30,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:30,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:30,487 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:30,487 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:30,487 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2647#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 2648#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2664#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2835#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2796#L555-1 assume !test_fun_#t~short8; 2725#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 2678#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2675#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-11-28 23:20:30,487 INFO L796 eck$LassoCheckResult]: Loop: 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2724#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2714#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2650#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2651#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2696#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2681#L555-1 assume !test_fun_#t~short8; 2683#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 2667#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2668#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-11-28 23:20:30,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:30,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2018-11-28 23:20:30,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:30,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:30,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:20:30,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:30,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2018-11-28 23:20:30,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:30,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:30,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:30,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:30,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:30,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:30,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2018-11-28 23:20:30,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:30,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:30,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:30,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:30,841 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-11-28 23:20:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:20:30,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:30,994 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:31,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:20:31,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-28 23:20:31,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:20:31,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:31,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 23:20:31,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-11-28 23:20:31,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-28 23:20:31,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:20:31,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-11-28 23:20:31,145 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:31,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-11-28 23:20:31,152 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:31,153 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 32 treesize of output 23 [2018-11-28 23:20:31,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2018-11-28 23:20:31,198 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:20:31,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-11-28 23:20:31,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-28 23:20:31,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,210 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:31,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-28 23:20:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:20:31,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-28 23:20:31,477 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-11-28 23:20:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 23:20:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-11-28 23:20:31,512 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 13 states. [2018-11-28 23:20:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:31,692 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2018-11-28 23:20:31,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:20:31,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2018-11-28 23:20:31,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-11-28 23:20:31,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2018-11-28 23:20:31,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-11-28 23:20:31,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-11-28 23:20:31,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2018-11-28 23:20:31,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:31,700 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-11-28 23:20:31,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2018-11-28 23:20:31,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-11-28 23:20:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-28 23:20:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-11-28 23:20:31,705 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-11-28 23:20:31,705 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-11-28 23:20:31,705 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:20:31,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2018-11-28 23:20:31,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-11-28 23:20:31,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:31,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:31,707 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:20:31,707 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:20:31,707 INFO L794 eck$LassoCheckResult]: Stem: 3306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3304#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 3305#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3351#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3350#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3345#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3346#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3341#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3342#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3338#L555-1 assume !test_fun_#t~short8; 3337#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 3336#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3334#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-11-28 23:20:31,707 INFO L796 eck$LassoCheckResult]: Loop: 3322#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3401#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3398#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3396#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3394#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3391#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3389#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3386#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3387#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3380#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3381#L555-1 assume !test_fun_#t~short8; 3332#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 3333#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3321#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-11-28 23:20:31,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:31,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2018-11-28 23:20:31,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:31,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:31,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:31,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:31,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2018-11-28 23:20:31,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:31,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:31,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:31,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:31,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:31,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:31,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2018-11-28 23:20:31,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:31,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:31,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:31,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:32,050 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-11-28 23:20:32,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:20:32,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:20:32,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:20:32,418 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:20:32,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-11-28 23:20:32,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:20:32,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:32,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 23:20:32,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-28 23:20:32,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-11-28 23:20:32,555 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,569 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 38 treesize of output 54 [2018-11-28 23:20:32,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,591 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2018-11-28 23:20:32,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-11-28 23:20:32,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:32,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:32,671 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2018-11-28 23:20:32,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,854 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-11-28 23:20:32,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:20:32,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-11-28 23:20:32,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,899 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-11-28 23:20:32,915 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:32,916 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 37 treesize of output 26 [2018-11-28 23:20:32,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:20:32,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:32,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:47 [2018-11-28 23:20:32,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:33,004 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 39 treesize of output 51 [2018-11-28 23:20:33,010 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-11-28 23:20:33,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:33,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:33,051 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:33,053 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:33,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 23:20:33,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-11-28 23:20:33,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 23:20:33,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:33,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 23:20:33,107 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:49 [2018-11-28 23:20:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:20:33,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:20:33,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-28 23:20:33,572 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2018-11-28 23:20:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 23:20:33,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-11-28 23:20:33,611 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-11-28 23:20:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:20:34,116 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-11-28 23:20:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:20:34,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2018-11-28 23:20:34,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:34,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2018-11-28 23:20:34,127 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-28 23:20:34,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:20:34,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2018-11-28 23:20:34,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:20:34,127 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-11-28 23:20:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2018-11-28 23:20:34,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-11-28 23:20:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-28 23:20:34,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-28 23:20:34,131 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-28 23:20:34,131 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-28 23:20:34,131 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:20:34,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2018-11-28 23:20:34,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:20:34,132 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:20:34,132 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:20:34,132 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-28 23:20:34,132 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:20:34,141 INFO L794 eck$LassoCheckResult]: Stem: 3664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3662#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := 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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, 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_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;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 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); 3663#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3669#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3670#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3700#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3699#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3698#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3697#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3696#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3695#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3694#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3693#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3682#L555-1 assume !test_fun_#t~short8; 3680#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7; 3679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3678#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3671#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3672#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-11-28 23:20:34,141 INFO L796 eck$LassoCheckResult]: Loop: 3676#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3665#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem5;havoc test_fun_#t~mem6;havoc test_fun_#t~short8;havoc test_fun_#t~mem7;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3666#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3673#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-11-28 23:20:34,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:34,141 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2018-11-28 23:20:34,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:34,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:34,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:34,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:34,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:34,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:34,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2018-11-28 23:20:34,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:34,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:34,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:34,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:34,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2018-11-28 23:20:34,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:20:34,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:20:34,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:34,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:20:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:20:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:20:35,134 WARN L180 SmtUtils]: Spent 908.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2018-11-28 23:20:35,252 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-28 23:20:36,852 WARN L180 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 198 DAG size of output: 150 [2018-11-28 23:20:36,987 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-28 23:20:36,990 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:20:36,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:20:36,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:20:36,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:20:36,990 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:20:36,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:20:36,991 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:20:36,991 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:20:36,991 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-11-28 23:20:36,991 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:20:36,991 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:20:36,998 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:37,024 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:37,029 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:37,032 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:37,033 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:37,035 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:37,037 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:37,038 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:37,040 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:37,041 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:37,042 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:37,044 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:37,047 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:37,049 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:37,051 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:37,054 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:37,056 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:37,057 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:37,260 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-11-28 23:20:37,410 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-28 23:20:38,005 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-11-28 23:20:38,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:20:38,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:20:38,100 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:38,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,103 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:38,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,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:38,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,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:38,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,110 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,110 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:38,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,112 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:38,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,115 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:38,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,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:38,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,117 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,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:38,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,119 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,120 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:38,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,122 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:38,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,123 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,123 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,124 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:38,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,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:38,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,126 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,128 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:38,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,129 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,129 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,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:38,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:20:38,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,138 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:20:38,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:20:38,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,139 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:38,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,147 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:38,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:20:38,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,153 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:38,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,154 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:38,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,155 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:38,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,164 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:38,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,165 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:20:38,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:20:38,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,166 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:20:38,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:20:38,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:20:38,172 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:38,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:20:38,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:20:38,173 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:20:38,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:20:38,195 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-28 23:20:38,195 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-28 23:20:38,314 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:20:38,465 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-28 23:20:38,466 INFO L444 ModelExtractionUtils]: 34 out of 46 variables were initially zero. Simplification set additionally 9 variables to zero. [2018-11-28 23:20:38,466 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:20:38,467 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-28 23:20:38,471 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:20:38,471 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)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2018-11-28 23:20:38,763 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-11-28 23:20:38,779 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:20:39,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:39,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:39,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:39,492 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2018-11-28 23:20:39,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:39,594 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 42 [2018-11-28 23:20:39,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:39,601 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 42 treesize of output 29 [2018-11-28 23:20:39,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:39,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:39,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:39,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-28 23:20:39,998 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:39,998 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:39,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:20:40,058 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2018-11-28 23:20:40,062 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:40,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-28 23:20:40,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-28 23:20:40,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:40,063 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:40,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:40,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:40,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:40,183 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:40,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 42 [2018-11-28 23:20:40,186 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:40,187 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 42 treesize of output 29 [2018-11-28 23:20:40,188 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:40,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:40,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:40,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-28 23:20:40,221 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:40,221 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:20:40,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:20:40,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2018-11-28 23:20:40,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:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-28 23:20:40,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-28 23:20:40,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:40,273 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:20:40,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:20:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:40,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:20:40,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:20:40,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:40,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 42 [2018-11-28 23:20:40,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:20:40,391 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 42 treesize of output 29 [2018-11-28 23:20:40,392 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:40,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:40,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-28 23:20:40,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-11-28 23:20:40,451 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:40,451 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:20:40,451 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:20:40,522 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2018-11-28 23:20:40,524 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:40,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:20:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-28 23:20:40,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2018-11-28 23:20:40,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:40,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2018-11-28 23:20:40,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:40,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2018-11-28 23:20:40,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:20:40,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2018-11-28 23:20:40,527 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:40,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-28 23:20:40,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:20:40,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:20:40,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:20:40,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:20:40,527 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:40,527 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:40,528 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:20:40,528 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:20:40,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:20:40,529 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:20:40,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:20:40,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:20:40 BoogieIcfgContainer [2018-11-28 23:20:40,536 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:20:40,537 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:20:40,537 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:20:40,537 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:20:40,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:20:02" (3/4) ... [2018-11-28 23:20:40,544 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:20:40,544 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:20:40,545 INFO L168 Benchmark]: Toolchain (without parser) took 39114.81 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 431.5 MB). Free memory was 948.7 MB in the beginning and 1.2 GB in the end (delta: -289.0 MB). Peak memory consumption was 142.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:40,545 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:40,545 INFO L168 Benchmark]: CACSL2BoogieTranslator took 570.59 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 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:40,546 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:40,546 INFO L168 Benchmark]: Boogie Preprocessor took 38.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:40,552 INFO L168 Benchmark]: RCFGBuilder took 499.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:40,552 INFO L168 Benchmark]: BuchiAutomizer took 37862.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.6 MB). Peak memory consumption was 164.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:20:40,553 INFO L168 Benchmark]: Witness Printer took 7.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:20:40,555 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 570.59 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 927.2 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 131.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 499.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 37862.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 294.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -130.6 MB). Peak memory consumption was 164.1 MB. Max. memory is 11.5 GB. * Witness Printer took 7.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 37.8s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 21.1s. Construction of modules took 2.0s. Büchi inclusion checks took 14.2s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 186 SDslu, 83 SDs, 0 SdLazy, 774 SolverSat, 167 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital364 mio100 ax105 hnf99 lsp82 ukn56 mio100 lsp35 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf172 smp82 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 266ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...