./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/Toulouse-BranchesToLoop-alloca_true-termination.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 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:28:44,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:28:44,418 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:28:44,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:28:44,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:28:44,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:28:44,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:28:44,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:28:44,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:28:44,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:28:44,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:28:44,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:28:44,441 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:28:44,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:28:44,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:28:44,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:28:44,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:28:44,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:28:44,451 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:28:44,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:28:44,454 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:28:44,455 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:28:44,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:28:44,458 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:28:44,458 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:28:44,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:28:44,461 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:28:44,462 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:28:44,463 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:28:44,465 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:28:44,465 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:28:44,466 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:28:44,466 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:28:44,467 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:28:44,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:28:44,469 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:28:44,469 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:28:44,490 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:28:44,490 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:28:44,491 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:28:44,491 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:28:44,492 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:28:44,492 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:28:44,492 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:28:44,492 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:28:44,492 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:28:44,492 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:28:44,493 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:28:44,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:28:44,494 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:28:44,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:28:44,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:28:44,495 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:28:44,495 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:28:44,495 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:28:44,496 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:28:44,496 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:28:44,496 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:28:44,496 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:28:44,496 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:28:44,496 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:28:44,497 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:28:44,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:28:44,497 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:28:44,497 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:28:44,500 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:28:44,500 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 -> 00af3b6676c9262f2d1d8ee1ad0dddc75df98c14 [2019-01-14 02:28:44,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:28:44,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:28:44,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:28:44,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:28:44,573 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:28:44,575 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2019-01-14 02:28:44,641 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e739e565a/8d0ae8a5f61c4ae88f9ba88eb837b048/FLAGfcd467593 [2019-01-14 02:28:45,198 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:28:45,199 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2019-01-14 02:28:45,213 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e739e565a/8d0ae8a5f61c4ae88f9ba88eb837b048/FLAGfcd467593 [2019-01-14 02:28:45,465 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e739e565a/8d0ae8a5f61c4ae88f9ba88eb837b048 [2019-01-14 02:28:45,469 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:28:45,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:28:45,472 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:28:45,472 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:28:45,477 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:28:45,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:28:45" (1/1) ... [2019-01-14 02:28:45,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4998b6ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:45, skipping insertion in model container [2019-01-14 02:28:45,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:28:45" (1/1) ... [2019-01-14 02:28:45,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:28:45,545 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:28:45,853 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:28:45,866 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:28:45,942 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:28:46,006 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:28:46,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46 WrapperNode [2019-01-14 02:28:46,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:28:46,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:28:46,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:28:46,009 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:28:46,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:28:46,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:28:46,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:28:46,127 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:28:46,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,148 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... [2019-01-14 02:28:46,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:28:46,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:28:46,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:28:46,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:28:46,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:28:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:28:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:28:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:28:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:28:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:28:46,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:28:46,603 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:28:46,603 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:28:46,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:28:46 BoogieIcfgContainer [2019-01-14 02:28:46,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:28:46,605 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:28:46,605 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:28:46,608 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:28:46,609 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:28:46,609 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:28:45" (1/3) ... [2019-01-14 02:28:46,610 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23470787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:28:46, skipping insertion in model container [2019-01-14 02:28:46,611 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:28:46,611 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:28:46" (2/3) ... [2019-01-14 02:28:46,612 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@23470787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:28:46, skipping insertion in model container [2019-01-14 02:28:46,612 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:28:46,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:28:46" (3/3) ... [2019-01-14 02:28:46,615 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2019-01-14 02:28:46,679 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:28:46,680 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:28:46,680 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:28:46,680 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:28:46,681 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:28:46,681 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:28:46,681 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:28:46,682 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:28:46,682 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:28:46,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:28:46,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:46,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:28:46,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:28:46,721 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:28:46,721 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:28:46,722 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:28:46,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-14 02:28:46,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:46,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:28:46,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:28:46,724 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:28:46,724 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:28:46,730 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 4#L553true assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 12#L558-4true [2019-01-14 02:28:46,731 INFO L796 eck$LassoCheckResult]: Loop: 12#L558-4true call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 6#L558true assume !main_#t~short10; 9#L558-2true assume !!main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~short10;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 12#L558-4true [2019-01-14 02:28:46,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:28:46,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:46,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:46,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:46,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:46,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:46,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:46,914 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2019-01-14 02:28:46,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:46,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:46,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:46,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:28:47,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:28:47,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:28:47,033 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:28:47,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:28:47,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:28:47,057 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-01-14 02:28:47,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:28:47,155 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-14 02:28:47,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:28:47,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2019-01-14 02:28:47,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:47,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2019-01-14 02:28:47,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:28:47,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:28:47,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-01-14 02:28:47,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:28:47,167 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:28:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-01-14 02:28:47,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-14 02:28:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:28:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:28:47,200 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:28:47,200 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:28:47,200 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:28:47,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-14 02:28:47,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:47,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:28:47,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:28:47,203 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:28:47,203 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:28:47,203 INFO L794 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 30#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 31#L553 assume !(0 != main_#t~nondet7);havoc main_#t~nondet7;call write~int(-1, main_~x~0.base, main_~x~0.offset, 4); 32#L558-4 [2019-01-14 02:28:47,204 INFO L796 eck$LassoCheckResult]: Loop: 32#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 33#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 34#L558-2 assume !!main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~short10;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 32#L558-4 [2019-01-14 02:28:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2019-01-14 02:28:47,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:47,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:47,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:47,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:47,263 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2019-01-14 02:28:47,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:47,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:47,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:47,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:28:47,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:47,390 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2019-01-14 02:28:47,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:47,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:47,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:47,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:47,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:48,013 WARN L181 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-14 02:28:48,215 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 02:28:49,154 WARN L181 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-01-14 02:28:49,427 WARN L181 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 02:28:49,441 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:28:49,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:28:49,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:28:49,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:28:49,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:28:49,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:28:49,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:28:49,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:28:49,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:28:49,444 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:28:49,445 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:28:49,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:49,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:50,387 WARN L181 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-01-14 02:28:50,777 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:28:50,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:50,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:50,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:50,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:50,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:50,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:51,042 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-01-14 02:28:55,401 WARN L181 SmtUtils]: Spent 3.84 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-14 02:28:55,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:28:55,463 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:28:55,465 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 [2019-01-14 02:28:55,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,474 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 [2019-01-14 02:28:55,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,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 [2019-01-14 02:28:55,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,489 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 [2019-01-14 02:28:55,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,499 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 [2019-01-14 02:28:55,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,507 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 [2019-01-14 02:28:55,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,513 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 [2019-01-14 02:28:55,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,519 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 [2019-01-14 02:28:55,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,521 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 [2019-01-14 02:28:55,525 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,526 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,529 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 [2019-01-14 02:28:55,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:28:55,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:28:55,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:28:55,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,535 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 [2019-01-14 02:28:55,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,545 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,545 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,577 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 [2019-01-14 02:28:55,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,591 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 [2019-01-14 02:28:55,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:28:55,605 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 [2019-01-14 02:28:55,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:28:55,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:28:55,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:28:55,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:28:55,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:28:55,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:28:55,624 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:28:55,633 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:28:55,637 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:28:55,639 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:28:55,641 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:28:55,642 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:28:55,642 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 199 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 - 1 >= 0] [2019-01-14 02:28:55,905 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2019-01-14 02:28:55,922 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:28:55,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:55,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:28:56,024 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-01-14 02:28:56,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,052 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 25 treesize of output 41 [2019-01-14 02:28:56,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2019-01-14 02:28:56,296 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 02:28:56,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:28:56,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-01-14 02:28:56,321 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:28:56,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:56,342 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:56,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:56,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:28:56,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2019-01-14 02:28:56,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:28:56,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:28:56,737 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-14 02:28:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:28:56,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-14 02:28:56,748 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-14 02:28:57,218 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 12 states and 14 transitions. Complement of second has 7 states. [2019-01-14 02:28:57,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:28:57,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:28:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:28:57,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:28:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:28:57,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:28:57,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:28:57,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:28:57,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:28:57,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-14 02:28:57,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:57,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2019-01-14 02:28:57,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:28:57,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:28:57,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2019-01-14 02:28:57,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:28:57,226 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-14 02:28:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2019-01-14 02:28:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-14 02:28:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:28:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-14 02:28:57,227 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-14 02:28:57,227 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-14 02:28:57,228 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:28:57,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2019-01-14 02:28:57,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:28:57,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:28:57,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:28:57,230 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:28:57,230 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:28:57,230 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 257#L-1 havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem8, main_#t~mem9, main_#t~short10, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset, main_~m~0.base, main_~m~0.offset, main_~n~0.base, main_~n~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~m~0.base, main_~m~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnStack(4);main_~n~0.base, main_~n~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset; 258#L553 assume 0 != main_#t~nondet7;havoc main_#t~nondet7;call write~int(1, main_~x~0.base, main_~x~0.offset, 4); 259#L558-4 [2019-01-14 02:28:57,230 INFO L796 eck$LassoCheckResult]: Loop: 259#L558-4 call main_#t~mem8 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short10 := main_#t~mem8 < 100; 260#L558 assume main_#t~short10;call main_#t~mem9 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short10 := main_#t~mem9 < 100; 261#L558-2 assume !!main_#t~short10;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~short10;call main_#t~mem11 := read~int(main_~y~0.base, main_~y~0.offset, 4);call main_#t~mem12 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 + main_#t~mem12, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem12;havoc main_#t~mem11;call main_#t~mem13 := read~int(main_~z~0.base, main_~z~0.offset, 4);call main_#t~mem14 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem13 - main_#t~mem14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem14;havoc main_#t~mem13; 259#L558-4 [2019-01-14 02:28:57,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:57,231 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-14 02:28:57,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:57,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:57,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:57,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:57,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:57,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:57,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:57,293 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 2 times [2019-01-14 02:28:57,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:57,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:57,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:57,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:28:57,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:28:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash 889511698, now seen corresponding path program 1 times [2019-01-14 02:28:57,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:28:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:28:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:57,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:28:57,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:28:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:28:58,182 WARN L181 SmtUtils]: Spent 732.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-01-14 02:28:58,716 WARN L181 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 100 [2019-01-14 02:28:58,890 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-14 02:28:58,895 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:28:58,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:28:58,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:28:58,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:28:58,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:28:58,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:28:58,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:28:58,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:28:58,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:28:58,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:28:58,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:28:58,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:58,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:58,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:58,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:28:59,638 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 81 [2019-01-14 02:28:59,840 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-01-14 02:29:03,752 WARN L181 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2019-01-14 02:29:03,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:29:03,805 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:29:03,806 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 [2019-01-14 02:29:03,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,814 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 [2019-01-14 02:29:03,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,821 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,827 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 [2019-01-14 02:29:03,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,829 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 [2019-01-14 02:29:03,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,843 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 [2019-01-14 02:29:03,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,847 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 [2019-01-14 02:29:03,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,849 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,855 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 [2019-01-14 02:29:03,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,868 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 [2019-01-14 02:29:03,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,876 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 [2019-01-14 02:29:03,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,881 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 [2019-01-14 02:29:03,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,887 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 [2019-01-14 02:29:03,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,887 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,892 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 [2019-01-14 02:29:03,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,896 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,900 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 [2019-01-14 02:29:03,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,903 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,915 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 [2019-01-14 02:29:03,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,915 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,916 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,917 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 [2019-01-14 02:29:03,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,937 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 [2019-01-14 02:29:03,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:29:03,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,938 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:29:03,938 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:29:03,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:29:03,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,947 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,955 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 [2019-01-14 02:29:03,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,961 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:29:03,976 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 [2019-01-14 02:29:03,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:29:03,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:29:03,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:29:03,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:29:03,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:29:03,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:29:03,998 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:29:04,012 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:29:04,018 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:29:04,019 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:29:04,021 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 02:29:04,022 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:29:04,022 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2019-01-14 02:29:04,302 INFO L297 tatePredicateManager]: 34 out of 40 supporting invariants were superfluous and have been removed [2019-01-14 02:29:04,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:29:04,316 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 02:29:04,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:29:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:04,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,380 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 34 treesize of output 43 [2019-01-14 02:29:04,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2019-01-14 02:29:04,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 45 [2019-01-14 02:29:04,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 02:29:04,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-01-14 02:29:04,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,522 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 02:29:04,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:20 [2019-01-14 02:29:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:29:04,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:29:04,729 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-14 02:29:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:29:04,760 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-01-14 02:29:04,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2019-01-14 02:29:04,839 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1. Second operand 5 states. Result 9 states and 10 transitions. Complement of second has 7 states. [2019-01-14 02:29:04,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:29:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:29:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-14 02:29:04,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-14 02:29:04,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:04,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-14 02:29:04,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:04,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-14 02:29:04,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:29:04,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-14 02:29:04,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:29:04,844 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2019-01-14 02:29:04,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:29:04,844 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:29:04,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:29:04,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:29:04,844 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:29:04,844 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:29:04,844 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:29:04,845 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:29:04,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:29:04,845 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:29:04,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:29:04,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:29:04 BoogieIcfgContainer [2019-01-14 02:29:04,851 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:29:04,852 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:29:04,852 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:29:04,852 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:29:04,852 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:28:46" (3/4) ... [2019-01-14 02:29:04,855 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:29:04,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:29:04,856 INFO L168 Benchmark]: Toolchain (without parser) took 19386.22 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 355.5 MB). Free memory was 947.3 MB in the beginning and 994.9 MB in the end (delta: -47.6 MB). Peak memory consumption was 307.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:04,857 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:04,858 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.22 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 924.5 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:04,859 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:04,860 INFO L168 Benchmark]: Boogie Preprocessor took 31.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:04,860 INFO L168 Benchmark]: RCFGBuilder took 446.64 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:04,861 INFO L168 Benchmark]: BuchiAutomizer took 18246.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.1 GB in the beginning and 994.9 MB in the end (delta: 113.4 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:29:04,862 INFO L168 Benchmark]: Witness Printer took 3.80 ms. Allocated memory is still 1.4 GB. Free memory is still 994.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:29:04,866 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 535.22 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 924.5 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 117.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -201.6 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 446.64 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.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18246.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 216.0 MB). Free memory was 1.1 GB in the beginning and 994.9 MB in the end (delta: 113.4 MB). Peak memory consumption was 329.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.80 ms. Allocated memory is still 1.4 GB. Free memory is still 994.9 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z][z] + 199 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y][y] + 199 * unknown-#memory_int-unknown[x][x] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 16.1s. Construction of modules took 0.1s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 6 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 15 SDtfs, 13 SDslu, 8 SDs, 0 SdLazy, 24 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital369 mio100 ax104 hnf100 lsp90 ukn58 mio100 lsp35 div100 bol100 ite100 ukn100 eq189 hnf88 smp98 dnf1799 smp89 tf100 neg91 sie128 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...