./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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/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-91b1670 [2018-11-28 23:18:47,868 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:47,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:47,882 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:47,883 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:47,884 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:47,885 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:47,887 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:47,889 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:47,890 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:47,891 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:47,891 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:47,893 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:47,894 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:47,895 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:47,896 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:47,897 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:47,899 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:47,901 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:47,902 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:47,903 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:47,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:47,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:47,908 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:47,908 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:47,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:47,912 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:47,913 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:47,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:47,918 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:47,919 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:47,919 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:47,920 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:47,920 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:47,921 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:47,922 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:47,922 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:47,938 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:47,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:47,940 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:47,940 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:47,940 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:47,940 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:47,941 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:47,941 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:47,942 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:47,942 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:47,942 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:47,942 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:47,942 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:47,942 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:47,943 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:47,943 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:47,943 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:47,943 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:47,943 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:47,943 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:47,944 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:47,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:47,946 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:47,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:47,946 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:47,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:47,946 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:47,946 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:47,948 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:47,948 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 [2018-11-28 23:18:47,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:48,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:48,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:48,013 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:48,014 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:48,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-28 23:18:48,078 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7198343a8/006bdc737e6e47f3b8c19f0b66df031a/FLAG2f34061e7 [2018-11-28 23:18:48,562 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:48,563 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-28 23:18:48,580 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7198343a8/006bdc737e6e47f3b8c19f0b66df031a/FLAG2f34061e7 [2018-11-28 23:18:48,864 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7198343a8/006bdc737e6e47f3b8c19f0b66df031a [2018-11-28 23:18:48,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:48,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:48,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:48,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:48,877 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:48,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:48" (1/1) ... [2018-11-28 23:18:48,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@653175f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:48, skipping insertion in model container [2018-11-28 23:18:48,882 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:48" (1/1) ... [2018-11-28 23:18:48,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:48,949 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:49,362 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:49,381 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:49,458 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:49,506 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:49,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49 WrapperNode [2018-11-28 23:18:49,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:49,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:49,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:49,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:49,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:49,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:49,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:49,632 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:49,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... [2018-11-28 23:18:49,659 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:49,659 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:49,659 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:49,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:49,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:50,093 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:50,094 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:18:50,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:50 BoogieIcfgContainer [2018-11-28 23:18:50,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:50,095 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:50,096 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:50,101 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:50,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:50,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:48" (1/3) ... [2018-11-28 23:18:50,103 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ebf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:50, skipping insertion in model container [2018-11-28 23:18:50,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:50,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:49" (2/3) ... [2018-11-28 23:18:50,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ebf1e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:50, skipping insertion in model container [2018-11-28 23:18:50,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:50,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:50" (3/3) ... [2018-11-28 23:18:50,107 INFO L375 chiAutomizerObserver]: Analyzing ICFG Toulouse-BranchesToLoop-alloca_true-termination.c.i [2018-11-28 23:18:50,177 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:50,181 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:50,181 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:50,181 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:50,182 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:50,182 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:50,182 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:50,182 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:50,182 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:50,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:18:50,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:50,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:50,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:50,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:50,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:50,226 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:50,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2018-11-28 23:18:50,228 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:50,228 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:50,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:50,229 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:50,229 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:50,237 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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-11-28 23:18:50,237 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~short10;havoc main_#t~mem9;havoc main_#t~mem8;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~mem11;havoc main_#t~mem12;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~mem13;havoc main_#t~mem14; 12#L558-4true [2018-11-28 23:18:50,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-11-28 23:18:50,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:50,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:50,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:50,414 INFO L82 PathProgramCache]: Analyzing trace with hash 41873, now seen corresponding path program 1 times [2018-11-28 23:18:50,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:50,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:50,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:50,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:50,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:18:50,501 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:18:50,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:18:50,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:18:50,522 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-11-28 23:18:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:50,578 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-28 23:18:50,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:18:50,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-28 23:18:50,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:50,588 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 6 states and 7 transitions. [2018-11-28 23:18:50,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:18:50,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:18:50,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2018-11-28 23:18:50,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:50,591 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:18:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2018-11-28 23:18:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-11-28 23:18:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:18:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-28 23:18:50,623 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:18:50,623 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-28 23:18:50,623 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:50,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-11-28 23:18:50,624 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:50,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:50,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:50,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:50,625 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:50,625 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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-11-28 23:18:50,625 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~short10;havoc main_#t~mem9;havoc main_#t~mem8;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~mem11;havoc main_#t~mem12;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~mem13;havoc main_#t~mem14; 32#L558-4 [2018-11-28 23:18:50,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-11-28 23:18:50,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:50,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:50,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:50,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 1 times [2018-11-28 23:18:50,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:50,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:50,830 INFO L82 PathProgramCache]: Analyzing trace with hash 889571280, now seen corresponding path program 1 times [2018-11-28 23:18:50,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:50,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:50,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:51,367 WARN L180 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-28 23:18:51,685 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 23:18:52,506 WARN L180 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-28 23:18:52,664 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2018-11-28 23:18:52,677 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:52,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:52,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:52,679 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:52,679 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:52,679 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:52,679 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:52,679 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:52,680 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:18:52,680 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:52,680 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:52,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:52,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:53,620 WARN L180 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 78 [2018-11-28 23:18:53,820 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-28 23:18:53,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:53,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:53,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:53,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:54,123 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-28 23:18:54,256 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-28 23:18:54,839 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:54,845 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:54,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 [2018-11-28 23:18:54,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,861 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,861 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,892 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,901 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,903 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:54,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:54,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:54,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,915 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,928 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,928 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,969 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:54,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,973 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:54,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:54,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:54,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:54,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:54,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:54,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:54,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:54,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:54,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:55,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:55,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:55,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:55,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:55,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:55,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:55,013 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:55,013 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:55,032 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:55,050 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:55,051 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:18:55,054 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:55,056 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:18:55,057 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:55,057 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] [2018-11-28 23:18:55,607 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 23:18:55,622 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:55,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:55,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:55,759 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 [2018-11-28 23:18:55,870 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-11-28 23:18:55,876 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:55,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:55,890 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 [2018-11-28 23:18:55,904 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 [2018-11-28 23:18:56,027 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-28 23:18:56,068 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:56,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:56,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:56,080 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:56,081 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 [2018-11-28 23:18:56,082 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:56,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:56,130 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:56,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:56,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:56,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-28 23:18:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:56,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:56,262 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 [2018-11-28 23:18:56,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-28 23:18:56,443 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. [2018-11-28 23:18:56,444 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 [2018-11-28 23:18:56,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 23:18:56,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:18:56,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:56,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:18:56,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:56,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:18:56,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:56,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2018-11-28 23:18:56,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:56,451 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 6 states and 6 transitions. [2018-11-28 23:18:56,451 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:18:56,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-28 23:18:56,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 6 transitions. [2018-11-28 23:18:56,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:56,451 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-28 23:18:56,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 6 transitions. [2018-11-28 23:18:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-11-28 23:18:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:18:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-11-28 23:18:56,453 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-28 23:18:56,453 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-11-28 23:18:56,453 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:56,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 6 transitions. [2018-11-28 23:18:56,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:56,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:56,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:56,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:18:56,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:56,454 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.alloc(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.alloc(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.alloc(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.alloc(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.alloc(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 [2018-11-28 23:18:56,454 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~short10;havoc main_#t~mem9;havoc main_#t~mem8;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~mem11;havoc main_#t~mem12;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~mem13;havoc main_#t~mem14; 259#L558-4 [2018-11-28 23:18:56,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:56,455 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2018-11-28 23:18:56,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:56,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:56,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:56,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:56,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:56,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:56,492 INFO L82 PathProgramCache]: Analyzing trace with hash 41811, now seen corresponding path program 2 times [2018-11-28 23:18:56,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:56,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:56,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:56,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:56,561 INFO L82 PathProgramCache]: Analyzing trace with hash 889511698, now seen corresponding path program 1 times [2018-11-28 23:18:56,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:56,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:56,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:56,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:56,781 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-11-28 23:18:57,102 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 94 [2018-11-28 23:18:57,217 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-11-28 23:18:57,221 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:57,221 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:57,221 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:57,222 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:57,222 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:57,222 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:57,222 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:57,222 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:57,222 INFO L131 ssoRankerPreferences]: Filename of dumped script: Toulouse-BranchesToLoop-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:57,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:57,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:57,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,785 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 75 [2018-11-28 23:18:57,928 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-11-28 23:18:57,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:57,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:58,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:58,799 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:58,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:58,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,801 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:58,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:58,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,802 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:58,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:58,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:58,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:58,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,804 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:58,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,806 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:58,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:58,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:58,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:58,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,813 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:58,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,815 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:58,815 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:58,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:58,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:58,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,820 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:58,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,821 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:58,821 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:58,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:58,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 [2018-11-28 23:18:58,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:58,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:58,829 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:58,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:58,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:58,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,835 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:58,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,837 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:58,837 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:58,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:58,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:58,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:58,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:58,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:58,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:58,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:58,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:58,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:58,855 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:58,856 INFO L444 ModelExtractionUtils]: 8 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:18:58,856 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:58,857 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2018-11-28 23:18:58,858 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:58,858 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) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 + 199 Supporting invariants [1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_2 - 1 >= 0] [2018-11-28 23:18:59,472 INFO L297 tatePredicateManager]: 36 out of 40 supporting invariants were superfluous and have been removed [2018-11-28 23:18:59,483 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:18:59,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:59,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:59,535 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 [2018-11-28 23:18:59,565 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:59,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:59,568 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 [2018-11-28 23:18:59,576 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 [2018-11-28 23:18:59,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:59,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:59,600 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:59,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 23:18:59,604 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 [2018-11-28 23:18:59,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 23:18:59,616 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:59,626 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:59,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:59,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:18:59,655 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:13 [2018-11-28 23:18:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:59,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:59,838 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-28 23:18:59,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:59,859 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 [2018-11-28 23:18:59,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 6 transitions. cyclomatic complexity: 1 Second operand 5 states. [2018-11-28 23:18:59,928 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. [2018-11-28 23:18:59,929 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 [2018-11-28 23:18:59,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:59,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2018-11-28 23:18:59,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:18:59,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:59,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:18:59,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:59,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:18:59,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:59,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2018-11-28 23:18:59,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:59,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 0 states and 0 transitions. [2018-11-28 23:18:59,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:59,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:59,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:59,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:59,936 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:59,936 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:59,936 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:59,936 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:59,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:59,937 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:59,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:59,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:59 BoogieIcfgContainer [2018-11-28 23:18:59,945 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:59,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:59,946 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:59,946 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:59,947 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:50" (3/4) ... [2018-11-28 23:18:59,950 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:59,950 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:59,951 INFO L168 Benchmark]: Toolchain (without parser) took 11081.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 954.0 MB in the beginning and 1.2 GB in the end (delta: -258.2 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:59,952 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:59,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 635.12 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:59,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 123.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:59,955 INFO L168 Benchmark]: Boogie Preprocessor took 27.06 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. [2018-11-28 23:18:59,955 INFO L168 Benchmark]: RCFGBuilder took 435.58 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:59,956 INFO L168 Benchmark]: BuchiAutomizer took 9849.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.0 MB). Peak memory consumption was 77.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:59,957 INFO L168 Benchmark]: Witness Printer took 5.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:59,962 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 635.12 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 932.6 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 123.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.06 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 435.58 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9849.66 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -106.0 MB). Peak memory consumption was 77.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.02 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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 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 9.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. Construction of modules took 0.0s. Büchi inclusion checks took 1.2s. 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.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital354 mio100 ax105 hnf100 lsp89 ukn55 mio100 lsp37 div100 bol100 ite100 ukn100 eq194 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 2 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...