./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/array02-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/array02-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 2a421301cdbe97036a5fec0597ad83df33c3e561 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:34,095 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:34,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:34,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:34,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:34,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:34,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:34,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:34,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:34,128 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:34,131 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:34,132 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:34,133 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:34,134 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:34,135 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:34,136 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:34,137 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:34,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:34,141 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:34,143 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:34,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:34,145 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:34,147 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:34,148 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:34,148 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:34,149 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:34,150 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:34,151 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:34,152 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:34,153 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:34,153 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:34,154 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:34,154 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:34,154 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:34,155 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:34,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:34,157 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:34,174 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:34,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:34,175 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:34,176 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:34,176 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:34,176 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:34,176 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:34,176 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:34,176 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:34,177 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:34,178 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:34,178 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:34,178 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:34,178 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:34,178 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:34,178 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:34,179 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:34,179 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:34,179 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:34,179 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:34,179 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:34,179 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:34,180 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:34,181 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:34,181 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:34,181 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:34,182 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:34,182 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:34,183 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:34,183 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 -> 2a421301cdbe97036a5fec0597ad83df33c3e561 [2018-11-28 23:19:34,220 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:34,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:34,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:34,243 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:34,243 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:34,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2018-11-28 23:19:34,306 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18db73a6c/b68aca4fb9cb455c938ab48a47cf5f91/FLAGc997172a9 [2018-11-28 23:19:34,851 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:34,852 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/array02-alloca_true-termination.c.i [2018-11-28 23:19:34,865 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18db73a6c/b68aca4fb9cb455c938ab48a47cf5f91/FLAGc997172a9 [2018-11-28 23:19:35,096 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18db73a6c/b68aca4fb9cb455c938ab48a47cf5f91 [2018-11-28 23:19:35,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:35,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:35,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:35,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:35,108 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:35,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34493d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35, skipping insertion in model container [2018-11-28 23:19:35,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:35,177 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:35,588 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:35,604 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:35,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:35,836 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:35,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35 WrapperNode [2018-11-28 23:19:35,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:35,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:35,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:35,838 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:35,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:35,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:35,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:35,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:35,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:35,958 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:35,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:35,959 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:35,959 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:36,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:36,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:36,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:36,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:36,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:36,562 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:36,562 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:19:36,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:36 BoogieIcfgContainer [2018-11-28 23:19:36,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:36,564 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:36,564 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:36,568 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:36,568 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:36,569 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:35" (1/3) ... [2018-11-28 23:19:36,570 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e4bf980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:36, skipping insertion in model container [2018-11-28 23:19:36,570 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:36,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (2/3) ... [2018-11-28 23:19:36,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7e4bf980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:36, skipping insertion in model container [2018-11-28 23:19:36,571 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:36,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:36" (3/3) ... [2018-11-28 23:19:36,573 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-termination.c.i [2018-11-28 23:19:36,630 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:36,631 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:36,631 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:36,631 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:36,632 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:36,632 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:36,632 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:36,632 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:36,632 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:36,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:19:36,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:19:36,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:36,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:36,675 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:36,675 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:36,675 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:36,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-28 23:19:36,677 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:19:36,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:36,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:36,678 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:36,678 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:19:36,686 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 6#L565true assume !(main_~array_size~0 < 1); 9#L565-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 16#L552-3true [2018-11-28 23:19:36,686 INFO L796 eck$LassoCheckResult]: Loop: 16#L552-3true assume !!(test_fun_~i~0 < test_fun_~N); 13#L553-3true assume !true; 5#L557-2true assume !true; 14#L552-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 16#L552-3true [2018-11-28 23:19:36,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,693 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 23:19:36,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:36,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-11-28 23:19:36,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:36,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:36,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:36,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:36,866 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:36,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:36,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:36,887 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-28 23:19:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:36,894 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-28 23:19:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:36,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-28 23:19:36,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:19:36,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-28 23:19:36,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:19:36,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:19:36,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-28 23:19:36,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:36,906 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:19:36,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-28 23:19:36,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:19:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:19:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-28 23:19:36,934 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:19:36,935 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-28 23:19:36,935 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:36,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-28 23:19:36,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:19:36,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:36,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:36,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:36,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:19:36,937 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 37#L565 assume !(main_~array_size~0 < 1); 39#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 40#L552-3 [2018-11-28 23:19:36,937 INFO L796 eck$LassoCheckResult]: Loop: 40#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 43#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 42#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L552-3 [2018-11-28 23:19:36,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 23:19:36,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:36,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-11-28 23:19:36,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:36,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-11-28 23:19:37,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,184 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:19:37,487 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 23:19:37,747 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 23:19:37,771 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:37,773 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:37,773 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:37,773 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:37,774 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:37,774 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:37,774 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:37,774 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:37,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:19:37,775 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:37,775 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:37,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,345 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:19:38,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,876 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:19:39,414 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:39,419 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:39,421 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:19:39,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,423 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,431 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:19:39,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,438 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:19:39,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,461 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:19:39,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,470 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:19:39,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,491 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:19:39,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,514 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:19:39,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,518 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:19:39,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,520 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,521 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,522 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,525 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:19:39,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,527 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,531 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,532 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:19:39,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,535 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,538 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,539 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:19:39,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,542 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:19:39,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,548 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,555 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:19:39,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,555 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,557 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,557 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,557 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,561 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:19:39,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,582 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:19:39,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,645 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:39,703 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:19:39,703 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:19:39,706 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:39,708 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:39,708 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:39,709 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~a.offset, v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1, ULTIMATE.start_test_fun_~i~0) = -1*ULTIMATE.start_test_fun_~a.offset + 1*v_rep(select #length ULTIMATE.start_test_fun_~a.base)_1 - 4*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-28 23:19:39,759 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:19:39,767 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:19:39,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:39,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:39,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:39,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:39,890 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:39,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-28 23:19:39,997 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 24 transitions. Complement of second has 6 states. [2018-11-28 23:19:39,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:19:40,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:19:40,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:19:40,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:19:40,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:19:40,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:40,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2018-11-28 23:19:40,006 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:40,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 17 states and 23 transitions. [2018-11-28 23:19:40,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:19:40,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:19:40,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2018-11-28 23:19:40,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:40,008 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2018-11-28 23:19:40,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2018-11-28 23:19:40,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-11-28 23:19:40,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:19:40,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-28 23:19:40,010 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 23:19:40,010 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-28 23:19:40,010 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:40,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-28 23:19:40,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:40,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:40,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:40,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:40,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:40,012 INFO L794 eck$LassoCheckResult]: Stem: 131#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 129#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 130#L565 assume !(main_~array_size~0 < 1); 132#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 133#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 136#L553-3 [2018-11-28 23:19:40,012 INFO L796 eck$LassoCheckResult]: Loop: 136#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 134#L553-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 136#L553-3 [2018-11-28 23:19:40,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,013 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-28 23:19:40,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-28 23:19:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 23:19:40,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,384 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2018-11-28 23:19:40,459 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:40,459 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:40,459 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:40,459 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:40,460 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:40,460 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:40,460 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:40,460 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:40,460 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:19:40,460 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:40,461 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:40,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:40,694 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:19:40,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,162 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:41,162 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:41,163 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:19:41,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,169 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:19:41,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,174 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:19:41,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,181 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:19:41,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,187 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:19:41,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:41,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,199 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,201 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:41,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,210 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:19:41,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,215 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:19:41,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,221 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:19:41,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,228 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:19:41,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,234 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:19:41,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,238 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,246 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:19:41,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,254 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:19:41,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,256 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,256 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,266 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:19:41,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,273 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:19:41,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,277 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,285 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:19:41,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,298 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:19:41,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,300 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,310 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:19:41,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,312 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,315 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:19:41,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:41,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,337 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:19:41,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,338 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:41,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,343 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:41,343 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:41,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:41,361 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:19:41,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:41,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:41,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:41,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:41,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:41,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:41,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:41,368 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:41,371 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:41,375 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:41,376 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:41,376 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:41,376 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:41,376 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-28 23:19:41,455 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:19:41,465 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:41,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:41,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:41,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:41,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:41,668 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:41,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:19:41,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 7 states. [2018-11-28 23:19:41,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:41,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:41,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:19:41,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:19:41,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:41,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:19:41,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:41,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:19:41,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:41,716 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-28 23:19:41,718 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:41,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-11-28 23:19:41,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:19:41,720 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:19:41,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-11-28 23:19:41,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:41,722 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-11-28 23:19:41,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-11-28 23:19:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-28 23:19:41,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-28 23:19:41,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-28 23:19:41,728 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 23:19:41,728 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-28 23:19:41,729 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:19:41,729 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-28 23:19:41,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:41,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:41,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:41,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:41,732 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:41,732 INFO L794 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 233#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 234#L565 assume !(main_~array_size~0 < 1); 235#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 236#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 251#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 238#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 239#L557-2 [2018-11-28 23:19:41,732 INFO L796 eck$LassoCheckResult]: Loop: 239#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 242#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 239#L557-2 [2018-11-28 23:19:41,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:41,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-28 23:19:41,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:41,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:41,769 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-11-28 23:19:41,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:41,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:41,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:41,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:41,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-11-28 23:19:41,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:41,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:41,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:41,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:41,926 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:19:42,168 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2018-11-28 23:19:42,231 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:42,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:42,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:42,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:42,231 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:42,232 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:42,232 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:42,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:42,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:19:42,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:42,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:42,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:19:42,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:43,024 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:43,024 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:43,025 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:19:43,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,031 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:19:43,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,037 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:19:43,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,040 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:19:43,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,042 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:19:43,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:43,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:43,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:43,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,043 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:19:43,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,045 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:43,047 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:19:43,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:43,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:43,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:43,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:43,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:43,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:43,056 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:43,058 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:43,058 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:43,059 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:43,060 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:43,060 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:43,060 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-28 23:19:43,176 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:19:43,191 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:43,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:43,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:43,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:43,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:43,338 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:43,338 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-28 23:19:43,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 31 states and 42 transitions. Complement of second has 7 states. [2018-11-28 23:19:43,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:43,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:19:43,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:19:43,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:43,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:19:43,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:43,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:19:43,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:43,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-11-28 23:19:43,370 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:43,371 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-11-28 23:19:43,371 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:19:43,371 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:19:43,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-28 23:19:43,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:43,371 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-28 23:19:43,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-28 23:19:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-28 23:19:43,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:19:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-28 23:19:43,374 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:19:43,374 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-28 23:19:43,374 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:19:43,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-28 23:19:43,375 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:43,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:43,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:43,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:43,376 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:43,376 INFO L794 eck$LassoCheckResult]: Stem: 355#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 353#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 354#L565 assume !(main_~array_size~0 < 1); 356#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 357#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 362#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 373#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 372#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 364#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 365#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 366#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 360#L553-3 [2018-11-28 23:19:43,376 INFO L796 eck$LassoCheckResult]: Loop: 360#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 358#L553-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post5;havoc test_fun_#t~mem4;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 360#L553-3 [2018-11-28 23:19:43,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-11-28 23:19:43,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-28 23:19:43,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:43,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,400 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-11-28 23:19:43,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:43,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,585 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 23:19:43,888 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 23:19:43,981 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:43,981 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:43,981 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:43,981 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:43,982 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:43,982 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:43,982 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:43,982 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:43,982 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-28 23:19:43,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:43,983 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:43,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:43,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:19:43,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,192 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-11-28 23:19:44,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,709 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:44,709 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:44,710 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:19:44,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:44,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:44,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,714 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:19:44,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,716 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:19:44,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:44,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:44,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,719 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:19:44,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,721 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:19:44,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,723 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:19:44,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,725 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:19:44,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:44,727 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:44,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:44,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,730 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:19:44,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,732 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:44,732 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:44,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,734 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:19:44,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,736 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:19:44,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,738 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:44,738 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:44,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,742 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:19:44,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:44,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:44,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:44,746 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:19:44,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:44,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:44,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:44,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:44,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:44,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:44,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:44,748 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:44,750 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:44,750 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:44,750 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:44,750 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:19:44,750 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:44,751 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_2 Supporting invariants [] [2018-11-28 23:19:44,855 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:19:44,868 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:44,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:44,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:44,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:44,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:44,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:19:44,976 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-28 23:19:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:19:44,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:19:44,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:44,979 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:44,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:45,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:45,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:45,077 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:45,078 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:19:45,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 31 states and 39 transitions. Complement of second has 7 states. [2018-11-28 23:19:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:19:45,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:19:45,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:45,134 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:45,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:45,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:45,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:45,198 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:45,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:19:45,239 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 42 states and 53 transitions. Complement of second has 6 states. [2018-11-28 23:19:45,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:45,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:45,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 23:19:45,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-28 23:19:45,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:45,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 23:19:45,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:45,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-28 23:19:45,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:45,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-11-28 23:19:45,245 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:45,246 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-11-28 23:19:45,246 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:19:45,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:19:45,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-11-28 23:19:45,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:45,247 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-28 23:19:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-11-28 23:19:45,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-28 23:19:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:19:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-28 23:19:45,250 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 23:19:45,250 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-28 23:19:45,250 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:19:45,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-28 23:19:45,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:45,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:45,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:45,252 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:45,252 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:45,253 INFO L794 eck$LassoCheckResult]: Stem: 654#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 652#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 653#L565 assume !(main_~array_size~0 < 1); 655#L565-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 656#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 666#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 667#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 663#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 674#L557 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 669#L552-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 670#L552-3 assume !!(test_fun_~i~0 < test_fun_~N); 664#L553-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 657#L553-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 658#L557-2 [2018-11-28 23:19:45,253 INFO L796 eck$LassoCheckResult]: Loop: 658#L557-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L557 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem8;havoc test_fun_#t~post9;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 658#L557-2 [2018-11-28 23:19:45,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-11-28 23:19:45,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:45,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:45,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:45,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:45,269 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-11-28 23:19:45,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:45,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:45,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:45,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:45,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:45,275 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-11-28 23:19:45,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:45,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:45,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:45,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:45,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:45,629 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-28 23:19:45,692 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:45,692 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:45,692 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:45,692 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:45,692 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:45,692 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:45,692 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:45,693 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:45,693 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-28 23:19:45,693 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:45,693 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:45,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:45,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:45,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:45,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:45,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:45,968 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2018-11-28 23:19:46,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:46,423 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:46,423 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:46,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:46,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:46,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:46,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:46,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:46,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:46,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:46,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:46,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:46,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:46,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:46,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:46,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:46,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:46,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:46,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:46,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:46,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:46,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:46,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:46,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:46,445 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:46,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:46,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:46,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:46,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:46,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:46,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:46,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:46,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:46,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:46,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:46,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:46,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:46,452 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:19:46,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:46,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:46,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:46,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:46,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:46,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:46,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:46,475 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:19:46,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:46,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:46,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:46,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:46,480 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:46,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:46,489 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:46,494 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:46,494 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:46,495 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:46,495 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:46,496 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:46,496 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_4 Supporting invariants [] [2018-11-28 23:19:46,657 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-28 23:19:46,670 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:46,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:46,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:47,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:47,191 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:47,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:19:47,364 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-28 23:19:47,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:19:47,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 23:19:47,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:47,366 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:47,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:47,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:47,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:47,704 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:47,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:19:47,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 36 transitions. Complement of second has 7 states. [2018-11-28 23:19:47,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:47,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:19:47,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 23:19:47,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:47,730 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:47,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:47,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:47,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:47,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:47,813 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:47,813 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:19:47,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 6 states. [2018-11-28 23:19:47,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:47,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 23:19:47,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-28 23:19:47,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:47,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-28 23:19:47,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:47,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-28 23:19:47,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:47,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-28 23:19:47,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:47,842 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-28 23:19:47,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:47,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:47,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:47,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:47,842 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:47,842 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:47,842 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:47,842 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:19:47,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:47,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:47,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:47,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:47 BoogieIcfgContainer [2018-11-28 23:19:47,853 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:47,854 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:47,854 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:47,854 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:47,854 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:36" (3/4) ... [2018-11-28 23:19:47,858 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:47,858 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:47,859 INFO L168 Benchmark]: Toolchain (without parser) took 12757.39 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.0 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -156.1 MB). Peak memory consumption was 145.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:47,860 INFO L168 Benchmark]: CDTParser took 0.16 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:19:47,860 INFO L168 Benchmark]: CACSL2BoogieTranslator took 733.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:47,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:47,862 INFO L168 Benchmark]: Boogie Preprocessor took 59.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:47,862 INFO L168 Benchmark]: RCFGBuilder took 604.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:47,863 INFO L168 Benchmark]: BuchiAutomizer took 11289.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.9 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:47,864 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:47,868 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.16 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 733.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.56 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 604.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11289.72 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -34.9 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * a + unknown-#length-unknown[a] + -4 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][a + 4 * i] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.3s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 24 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 93 SDslu, 9 SDs, 0 SdLazy, 106 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital148 mio100 ax112 hnf99 lsp79 ukn77 mio100 lsp54 div100 bol100 ite100 ukn100 eq179 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 4 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...