./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash f42aa215a16d5e0efb670a585ba0238849a32fc4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-29 00:10:38,494 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:10:38,497 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:10:38,509 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:10:38,509 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:10:38,510 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:10:38,511 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:10:38,513 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:10:38,515 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:10:38,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:10:38,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:10:38,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:10:38,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:10:38,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:10:38,520 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:10:38,521 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:10:38,522 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:10:38,524 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:10:38,526 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:10:38,531 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:10:38,532 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:10:38,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:10:38,538 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:10:38,540 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:10:38,541 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:10:38,543 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:10:38,547 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:10:38,548 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:10:38,550 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:10:38,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:10:38,553 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:10:38,554 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:10:38,554 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:10:38,554 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:10:38,557 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:10:38,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:10:38,561 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:10:38,590 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:10:38,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:10:38,591 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:10:38,591 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:10:38,592 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:10:38,592 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:10:38,592 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:10:38,593 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:10:38,593 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:10:38,593 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:10:38,593 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:10:38,593 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:10:38,593 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:10:38,594 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:10:38,594 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:10:38,594 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:10:38,594 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:10:38,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:10:38,595 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:10:38,596 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:10:38,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:10:38,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:10:38,597 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:10:38,597 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:10:38,597 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:10:38,597 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:10:38,597 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:10:38,598 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:10:38,599 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:10:38,599 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:10:38,599 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:10:38,601 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:10:38,601 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f42aa215a16d5e0efb670a585ba0238849a32fc4 [2018-11-29 00:10:38,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:10:38,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:10:38,658 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:10:38,660 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:10:38,660 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:10:38,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:38,723 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863fe524b/f74abf07791f4a2f943e66eecff34e5f/FLAG0db534961 [2018-11-29 00:10:39,236 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:10:39,237 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/array02-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:39,252 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863fe524b/f74abf07791f4a2f943e66eecff34e5f/FLAG0db534961 [2018-11-29 00:10:39,538 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/863fe524b/f74abf07791f4a2f943e66eecff34e5f [2018-11-29 00:10:39,544 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:10:39,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:10:39,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:39,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:10:39,552 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:10:39,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:39" (1/1) ... [2018-11-29 00:10:39,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61960ee5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:39, skipping insertion in model container [2018-11-29 00:10:39,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:10:39" (1/1) ... [2018-11-29 00:10:39,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:10:39,616 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:10:39,998 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:40,011 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:10:40,058 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:10:40,123 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:10:40,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40 WrapperNode [2018-11-29 00:10:40,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:10:40,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:40,125 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:10:40,125 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:10:40,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:10:40,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:10:40,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:10:40,287 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:10:40,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (1/1) ... [2018-11-29 00:10:40,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:10:40,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:10:40,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:10:40,341 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:10:40,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (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-29 00:10:40,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-29 00:10:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-29 00:10:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-29 00:10:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-29 00:10:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:10:40,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:10:40,878 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:10:40,878 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-29 00:10:40,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:40 BoogieIcfgContainer [2018-11-29 00:10:40,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:10:40,880 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:10:40,880 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:10:40,884 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:10:40,885 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:40,885 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:10:39" (1/3) ... [2018-11-29 00:10:40,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5539fb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:40, skipping insertion in model container [2018-11-29 00:10:40,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:40,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:10:40" (2/3) ... [2018-11-29 00:10:40,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5539fb47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:10:40, skipping insertion in model container [2018-11-29 00:10:40,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:10:40,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:40" (3/3) ... [2018-11-29 00:10:40,890 INFO L375 chiAutomizerObserver]: Analyzing ICFG array02-alloca_true-valid-memsafety_true-termination.i [2018-11-29 00:10:40,960 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:10:40,961 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:10:40,961 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:10:40,961 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:10:40,962 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:10:40,962 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:10:40,962 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:10:40,962 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:10:40,962 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:10:40,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:10:41,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:10:41,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:41,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:41,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:41,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:41,008 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:10:41,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-29 00:10:41,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:10:41,010 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:41,010 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:41,010 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:41,010 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-29 00:10:41,018 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#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; 4#L558true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 5#L558-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; 11#L545-3true [2018-11-29 00:10:41,018 INFO L796 eck$LassoCheckResult]: Loop: 11#L545-3true assume !!(test_fun_~i~0 < test_fun_~N); 8#L546-3true assume !true; 3#L550-2true assume !true; 9#L545-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 11#L545-3true [2018-11-29 00:10:41,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,026 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-29 00:10:41,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:41,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1459151, now seen corresponding path program 1 times [2018-11-29 00:10:41,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:41,178 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-29 00:10:41,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:10:41,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:10:41,184 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:10:41,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-29 00:10:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-29 00:10:41,206 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-29 00:10:41,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:10:41,213 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-11-29 00:10:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-29 00:10:41,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-11-29 00:10:41,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:10:41,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 13 transitions. [2018-11-29 00:10:41,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-29 00:10:41,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:10:41,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2018-11-29 00:10:41,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:41,225 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:10:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2018-11-29 00:10:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-29 00:10:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-29 00:10:41,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-11-29 00:10:41,254 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:10:41,254 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-11-29 00:10:41,254 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:10:41,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-11-29 00:10:41,255 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-29 00:10:41,255 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:41,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:41,256 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-29 00:10:41,256 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-29 00:10:41,256 INFO L794 eck$LassoCheckResult]: Stem: 43#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 40#L558-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; 41#L545-3 [2018-11-29 00:10:41,257 INFO L796 eck$LassoCheckResult]: Loop: 41#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 42#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 38#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 45#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 41#L545-3 [2018-11-29 00:10:41,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,257 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-29 00:10:41,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:41,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1395295349, now seen corresponding path program 1 times [2018-11-29 00:10:41,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:41,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:41,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1896732327, now seen corresponding path program 1 times [2018-11-29 00:10:41,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:41,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:41,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:41,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:41,493 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:10:41,807 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-29 00:10:41,963 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-11-29 00:10:41,989 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:41,990 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:41,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:41,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:41,991 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:41,991 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:41,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:41,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:41,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2018-11-29 00:10:41,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:41,993 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:42,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10: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-29 00:10:42,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:42,812 WARN L180 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-11-29 00:10:42,946 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-11-29 00:10:42,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:43,529 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-29 00:10:43,553 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:43,558 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:43,560 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-29 00:10:43,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,564 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,564 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,571 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-29 00:10:43,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,573 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,575 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-29 00:10:43,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,578 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-29 00:10:43,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,588 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-29 00:10:43,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,592 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-29 00:10:43,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,595 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-29 00:10:43,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,604 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-29 00:10:43,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,607 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-29 00:10:43,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,610 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-29 00:10:43,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,612 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,619 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-29 00:10:43,619 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,623 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-29 00:10:43,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,626 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,626 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-29 00:10:43,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,629 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,629 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,634 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-29 00:10:43,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,636 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,638 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-29 00:10:43,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:43,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:43,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:43,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,642 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-29 00:10:43,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:43,666 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-29 00:10:43,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:43,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:43,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:43,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:43,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:43,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:43,803 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:43,859 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:43,859 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:10:43,866 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:43,870 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:43,870 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:43,872 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2018-11-29 00:10:43,915 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:43,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:43,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:44,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:44,046 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-29 00:10:44,051 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-29 00:10:44,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2018-11-29 00:10:44,109 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 17 states and 23 transitions. Complement of second has 4 states. [2018-11-29 00:10:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-29 00:10:44,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:44,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-29 00:10:44,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-29 00:10:44,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-29 00:10:44,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-29 00:10:44,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:44,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2018-11-29 00:10:44,119 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:44,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 16 states and 22 transitions. [2018-11-29 00:10:44,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:10:44,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-29 00:10:44,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2018-11-29 00:10:44,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:44,121 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-11-29 00:10:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2018-11-29 00:10:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-29 00:10:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-29 00:10:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2018-11-29 00:10:44,123 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-29 00:10:44,124 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2018-11-29 00:10:44,124 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:10:44,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2018-11-29 00:10:44,125 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:44,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:44,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:44,125 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-29 00:10:44,126 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:44,126 INFO L794 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 125#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; 126#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 131#L558-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; 132#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 133#L546-3 [2018-11-29 00:10:44,126 INFO L796 eck$LassoCheckResult]: Loop: 133#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 137#L546-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; 133#L546-3 [2018-11-29 00:10:44,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,126 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2018-11-29 00:10:44,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2018-11-29 00:10:44,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:44,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:44,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-29 00:10:44,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:44,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:44,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:44,366 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-29 00:10:44,614 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-29 00:10:44,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:44,689 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:44,689 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:44,689 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:44,691 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:44,691 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:44,691 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:44,691 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:44,691 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration3_Lasso [2018-11-29 00:10:44,691 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:44,691 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:44,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-29 00:10:44,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,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-29 00:10:44,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:44,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:45,339 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:45,339 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:45,339 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-29 00:10:45,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,345 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-29 00:10:45,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,350 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-29 00:10:45,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,352 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-29 00:10:45,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,355 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-29 00:10:45,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:45,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,360 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-29 00:10:45,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:45,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,366 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-29 00:10:45,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,368 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-29 00:10:45,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,371 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-29 00:10:45,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:45,373 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,376 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-29 00:10:45,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:45,378 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,381 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-29 00:10:45,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,383 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-29 00:10:45,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,386 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-29 00:10:45,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,389 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-29 00:10:45,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,392 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:45,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,400 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-29 00:10:45,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:45,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,405 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-29 00:10:45,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:45,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,458 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-29 00:10:45,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,459 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-29 00:10:45,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,461 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:10:45,461 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:45,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:45,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-29 00:10:45,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:45,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:45,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:45,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:45,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:45,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:45,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:45,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:45,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:45,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:45,481 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:45,481 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:10:45,481 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:45,481 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-29 00:10:45,557 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-29 00:10:45,572 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:45,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:45,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:45,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:46,099 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-29 00:10:46,100 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-29 00:10:46,100 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-29 00:10:46,342 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-29 00:10:46,344 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-29 00:10:46,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:46,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-29 00:10:46,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-29 00:10:46,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:46,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-29 00:10:46,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:46,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-29 00:10:46,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:46,348 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2018-11-29 00:10:46,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:46,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 27 states and 37 transitions. [2018-11-29 00:10:46,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-29 00:10:46,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-29 00:10:46,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2018-11-29 00:10:46,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:46,356 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-11-29 00:10:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2018-11-29 00:10:46,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-11-29 00:10:46,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-29 00:10:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-11-29 00:10:46,364 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-29 00:10:46,364 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-11-29 00:10:46,364 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:10:46,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2018-11-29 00:10:46,367 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:46,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:46,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:46,371 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:46,371 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:46,372 INFO L794 eck$LassoCheckResult]: Stem: 242#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 241#L558-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; 235#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 236#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 243#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 229#L550-2 [2018-11-29 00:10:46,372 INFO L796 eck$LassoCheckResult]: Loop: 229#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 230#L550 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; 229#L550-2 [2018-11-29 00:10:46,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-29 00:10:46,372 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,409 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 1 times [2018-11-29 00:10:46,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:46,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741076, now seen corresponding path program 1 times [2018-11-29 00:10:46,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:46,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:46,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:46,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:46,652 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-29 00:10:47,001 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2018-11-29 00:10:47,168 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-29 00:10:47,171 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:47,171 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:47,171 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:47,171 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:47,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:47,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:47,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:47,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:47,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2018-11-29 00:10:47,172 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:47,172 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:47,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,657 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-11-29 00:10:47,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:47,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:48,171 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:48,171 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-29 00:10:48,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,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-29 00:10:48,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,178 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-29 00:10:48,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,179 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,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-29 00:10:48,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,183 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-29 00:10:48,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:48,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:48,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:48,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:48,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:48,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:48,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:48,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:48,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:48,188 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:48,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:48,198 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:48,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:48,203 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:48,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:48,204 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:48,204 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:48,204 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-29 00:10:48,304 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:48,306 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:48,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:48,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:48,380 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-29 00:10:48,381 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-29 00:10:48,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 31 transitions. cyclomatic complexity: 14 Second operand 3 states. [2018-11-29 00:10:48,414 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-29 00:10:48,416 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-29 00:10:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:48,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:48,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-29 00:10:48,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-29 00:10:48,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-29 00:10:48,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:48,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 42 transitions. [2018-11-29 00:10:48,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:48,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 29 transitions. [2018-11-29 00:10:48,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-29 00:10:48,423 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-29 00:10:48,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 29 transitions. [2018-11-29 00:10:48,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:48,423 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2018-11-29 00:10:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 29 transitions. [2018-11-29 00:10:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-29 00:10:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-29 00:10:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-29 00:10:48,428 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-29 00:10:48,428 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-29 00:10:48,428 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:10:48,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-29 00:10:48,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-29 00:10:48,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:48,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:48,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:48,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:48,432 INFO L794 eck$LassoCheckResult]: Stem: 361#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 360#L558-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; 355#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 356#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 369#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 365#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 368#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 366#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 357#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 359#L546-3 [2018-11-29 00:10:48,432 INFO L796 eck$LassoCheckResult]: Loop: 359#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 362#L546-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; 359#L546-3 [2018-11-29 00:10:48,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1330840024, now seen corresponding path program 2 times [2018-11-29 00:10:48,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:48,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2018-11-29 00:10:48,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:48,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:48,467 INFO L82 PathProgramCache]: Analyzing trace with hash -962990435, now seen corresponding path program 1 times [2018-11-29 00:10:48,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:48,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:48,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:48,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:48,729 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-11-29 00:10:48,790 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:48,790 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:48,790 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:48,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:48,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:48,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:48,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:48,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:48,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration5_Lasso [2018-11-29 00:10:48,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:48,792 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:48,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:48,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:49,449 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:49,449 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:49,450 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-29 00:10:49,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:49,455 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:49,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,458 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-29 00:10:49,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:49,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:49,469 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:49,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,471 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-29 00:10:49,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,476 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-29 00:10:49,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,479 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-29 00:10:49,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,486 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-29 00:10:49,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:49,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:49,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,492 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-29 00:10:49,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,494 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-29 00:10:49,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,496 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-29 00:10:49,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:49,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:49,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,503 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-29 00:10:49,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:49,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:49,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:49,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:10:49,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:49,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:49,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:49,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:49,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:49,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:49,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:49,509 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:49,510 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-29 00:10:49,510 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-29 00:10:49,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:49,511 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-29 00:10:49,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:49,511 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-29 00:10:49,584 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-29 00:10:49,587 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:49,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,649 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-29 00:10:49,649 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-29 00:10:49,650 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:49,771 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-29 00:10:49,775 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-29 00:10:49,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:49,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-29 00:10:49,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-29 00:10:49,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:49,776 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:49,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,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-29 00:10:49,862 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-29 00:10:49,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:49,891 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-29 00:10:49,893 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-29 00:10:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-29 00:10:49,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-29 00:10:49,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:49,894 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:49,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:49,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:49,976 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-29 00:10:49,977 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-29 00:10:49,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-29 00:10:50,020 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-29 00:10:50,021 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-29 00:10:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:50,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-29 00:10:50,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 2 letters. [2018-11-29 00:10:50,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:50,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-29 00:10:50,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:50,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 11 letters. Loop has 4 letters. [2018-11-29 00:10:50,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:50,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2018-11-29 00:10:50,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:50,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 32 states and 42 transitions. [2018-11-29 00:10:50,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-29 00:10:50,027 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-29 00:10:50,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 42 transitions. [2018-11-29 00:10:50,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-29 00:10:50,028 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 42 transitions. [2018-11-29 00:10:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 42 transitions. [2018-11-29 00:10:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2018-11-29 00:10:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-29 00:10:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2018-11-29 00:10:50,034 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-29 00:10:50,034 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2018-11-29 00:10:50,034 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:10:50,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2018-11-29 00:10:50,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-29 00:10:50,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:10:50,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:10:50,037 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:10:50,037 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-29 00:10:50,037 INFO L794 eck$LassoCheckResult]: Stem: 660#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#L558 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 654#L558-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; 655#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 656#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 666#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 664#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 670#L550 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 668#L545-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 657#L545-3 assume !!(test_fun_~i~0 < test_fun_~N); 659#L546-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 661#L546-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 648#L550-2 [2018-11-29 00:10:50,037 INFO L796 eck$LassoCheckResult]: Loop: 648#L550-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 649#L550 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; 648#L550-2 [2018-11-29 00:10:50,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -962990437, now seen corresponding path program 3 times [2018-11-29 00:10:50,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:10:50,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash 2054, now seen corresponding path program 2 times [2018-11-29 00:10:50,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:50,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2015840224, now seen corresponding path program 1 times [2018-11-29 00:10:50,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:10:50,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:10:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:10:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:10:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:10:50,376 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-11-29 00:10:50,470 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:10:50,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:10:50,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:10:50,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:10:50,471 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:10:50,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:10:50,472 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:10:50,472 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:10:50,472 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca_true-valid-memsafety_true-termination.i_Iteration6_Lasso [2018-11-29 00:10:50,472 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:10:50,472 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:10:50,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,633 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 49 [2018-11-29 00:10:50,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:50,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:10:51,329 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:10:51,329 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:10:51,330 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-29 00:10:51,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:51,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:51,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:51,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:51,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:51,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:51,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:51,338 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-29 00:10:51,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:51,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:51,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:51,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:51,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:51,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:51,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:51,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:51,344 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-29 00:10:51,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:51,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:10:51,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:51,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:51,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:51,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:10:51,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:10:51,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:51,347 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-29 00:10:51,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:51,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:51,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:51,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:51,355 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:51,355 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:51,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:10:51,368 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-29 00:10:51,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:10:51,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:10:51,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:10:51,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:10:51,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:10:51,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-29 00:10:51,383 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-29 00:10:51,389 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-29 00:10:51,390 INFO L444 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-29 00:10:51,390 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-29 00:10:51,392 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-29 00:10:51,393 INFO L518 LassoAnalysis]: Proved termination. [2018-11-29 00:10:51,393 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)))_3) = 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)))_3 Supporting invariants [] [2018-11-29 00:10:51,548 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2018-11-29 00:10:51,561 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-29 00:10:51,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:51,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:51,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:52,075 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-29 00:10:52,076 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-29 00:10:52,076 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:52,238 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-29 00:10:52,240 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-29 00:10:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:52,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-29 00:10:52,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:52,241 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:52,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:52,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:52,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:52,434 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-29 00:10:52,435 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-29 00:10:52,435 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:52,449 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-29 00:10:52,450 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-29 00:10:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-29 00:10:52,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-29 00:10:52,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:52,452 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-29 00:10:52,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:10:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:52,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:10:52,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-29 00:10:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:10:52,496 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-29 00:10:52,496 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-29 00:10:52,515 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-29 00:10:52,517 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-29 00:10:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-29 00:10:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-29 00:10:52,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 2 letters. [2018-11-29 00:10:52,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:52,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 15 letters. Loop has 2 letters. [2018-11-29 00:10:52,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:52,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-29 00:10:52,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-29 00:10:52,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-11-29 00:10:52,522 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:52,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2018-11-29 00:10:52,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-29 00:10:52,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-29 00:10:52,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-29 00:10:52,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:10:52,524 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:52,525 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:52,525 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-29 00:10:52,525 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:10:52,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-29 00:10:52,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-29 00:10:52,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-29 00:10:52,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:10:52 BoogieIcfgContainer [2018-11-29 00:10:52,532 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:10:52,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:10:52,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:10:52,533 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:10:52,534 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:10:40" (3/4) ... [2018-11-29 00:10:52,539 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-29 00:10:52,539 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:10:52,540 INFO L168 Benchmark]: Toolchain (without parser) took 12994.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 116.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:52,541 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-29 00:10:52,541 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 929.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:52,543 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:52,543 INFO L168 Benchmark]: Boogie Preprocessor took 53.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:10:52,544 INFO L168 Benchmark]: RCFGBuilder took 538.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:52,545 INFO L168 Benchmark]: BuchiAutomizer took 11652.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.7 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:10:52,546 INFO L168 Benchmark]: Witness Printer took 5.93 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-29 00:10:52,551 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 577.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 929.9 MB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -176.8 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.93 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 538.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.2 MB). Peak memory consumption was 19.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11652.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -57.7 MB). Peak memory consumption was 125.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.93 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 #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 N + -1 * i and consists of 3 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][a + 4 * i] 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.5s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 8.8s. Construction of modules took 0.5s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 15 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, 85 SDslu, 9 SDs, 0 SdLazy, 108 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital152 mio100 ax100 hnf99 lsp89 ukn78 mio100 lsp55 div100 bol100 ite100 ukn100 eq175 hnf90 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms 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...