./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/array03-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/array03-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 987435cc8130e848f1b087d0b65ab8d71c3dfa3c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:19:34,277 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:19:34,279 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:19:34,293 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:19:34,293 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:19:34,294 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:19:34,296 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:19:34,298 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:19:34,300 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:19:34,300 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:19:34,301 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:19:34,302 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:19:34,303 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:19:34,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:19:34,305 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:19:34,306 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:19:34,307 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:19:34,309 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:19:34,312 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:19:34,314 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:19:34,315 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:19:34,316 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:19:34,319 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:19:34,320 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:19:34,320 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:19:34,321 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:19:34,323 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:19:34,324 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:19:34,325 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:19:34,326 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:19:34,326 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:19:34,327 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:19:34,327 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:19:34,328 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:19:34,329 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:19:34,330 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:19:34,331 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:19:34,348 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:19:34,348 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:19:34,349 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:19:34,349 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:19:34,350 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:19:34,350 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:19:34,350 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:19:34,351 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:19:34,351 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:19:34,351 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:19:34,351 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:19:34,351 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:19:34,351 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:19:34,352 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:19:34,352 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:19:34,352 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:19:34,352 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:19:34,352 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:19:34,352 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:19:34,354 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:19:34,354 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:19:34,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:19:34,355 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:19:34,355 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:19:34,355 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:19:34,355 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:19:34,355 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:19:34,356 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:19:34,357 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:19:34,358 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 987435cc8130e848f1b087d0b65ab8d71c3dfa3c [2018-11-28 23:19:34,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:19:34,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:19:34,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:19:34,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:19:34,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:19:34,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-11-28 23:19:34,481 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150f3b588/bbd16bb0c0ce491e8e2fc4da79430e41/FLAGea7333353 [2018-11-28 23:19:34,935 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:19:34,936 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/array03-alloca_true-termination.c.i [2018-11-28 23:19:34,952 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150f3b588/bbd16bb0c0ce491e8e2fc4da79430e41/FLAGea7333353 [2018-11-28 23:19:35,272 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/150f3b588/bbd16bb0c0ce491e8e2fc4da79430e41 [2018-11-28 23:19:35,276 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:19:35,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:19:35,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:35,279 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:19:35,283 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:19:35,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6802d536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35, skipping insertion in model container [2018-11-28 23:19:35,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:35,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:19:35,342 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:19:35,744 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:35,764 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:19:35,923 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:19:35,977 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:19:35,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35 WrapperNode [2018-11-28 23:19:35,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:19:35,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:35,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:19:35,979 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:19:35,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:19:36,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:19:36,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:19:36,043 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:19:36,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,079 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... [2018-11-28 23:19:36,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:19:36,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:19:36,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:19:36,093 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:19:36,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:19:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:19:36,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:19:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:19:36,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:19:36,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:19:36,559 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:19:36,559 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:19:36,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:36 BoogieIcfgContainer [2018-11-28 23:19:36,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:19:36,560 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:19:36,560 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:19:36,564 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:19:36,565 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:36,565 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:19:35" (1/3) ... [2018-11-28 23:19:36,566 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6066f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:36, skipping insertion in model container [2018-11-28 23:19:36,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:36,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:19:35" (2/3) ... [2018-11-28 23:19:36,567 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6066f5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:19:36, skipping insertion in model container [2018-11-28 23:19:36,567 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:19:36,567 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:36" (3/3) ... [2018-11-28 23:19:36,569 INFO L375 chiAutomizerObserver]: Analyzing ICFG array03-alloca_true-termination.c.i [2018-11-28 23:19:36,631 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:19:36,632 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:19:36,632 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:19:36,632 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:19:36,632 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:19:36,632 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:19:36,633 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:19:36,633 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:19:36,633 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:19:36,647 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:19:36,671 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:36,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:36,671 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:36,680 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:36,681 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:36,681 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:19:36,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2018-11-28 23:19:36,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:36,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:36,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:36,683 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:36,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-28 23:19:36,692 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 6#L567true assume !(main_~array_size~0 < 1); 10#L567-2true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 3#L551-3true [2018-11-28 23:19:36,693 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 13#L553true assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 7#L558-2true assume !true; 9#L558-3true call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 17#L551-2true test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 3#L551-3true [2018-11-28 23:19:36,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,700 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-11-28 23:19:36,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:36,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,837 INFO L82 PathProgramCache]: Analyzing trace with hash 44963621, now seen corresponding path program 1 times [2018-11-28 23:19:36,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:36,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:36,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:36,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:19:36,887 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:19:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:19:36,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:19:36,904 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 2 states. [2018-11-28 23:19:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:36,911 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2018-11-28 23:19:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:19:36,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2018-11-28 23:19:36,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:36,920 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2018-11-28 23:19:36,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:19:36,922 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:19:36,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-11-28 23:19:36,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:36,923 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:19:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-11-28 23:19:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:19:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:19:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-28 23:19:36,956 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:19:36,956 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-28 23:19:36,956 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:19:36,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-28 23:19:36,958 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:19:36,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:36,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:36,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:19:36,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:19:36,959 INFO L794 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 38#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 39#L567 assume !(main_~array_size~0 < 1); 47#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 40#L551-3 [2018-11-28 23:19:36,960 INFO L796 eck$LassoCheckResult]: Loop: 40#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 41#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 42#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 44#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 45#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 48#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 40#L551-3 [2018-11-28 23:19:36,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,960 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2018-11-28 23:19:36,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:36,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:36,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1393657929, now seen corresponding path program 1 times [2018-11-28 23:19:36,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:36,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:36,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1898369747, now seen corresponding path program 1 times [2018-11-28 23:19:37,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:37,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:37,376 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:19:37,533 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-28 23:19:37,776 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-28 23:19:37,805 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:37,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:37,807 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:37,807 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:37,807 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:37,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:37,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:37,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:37,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:19:37,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:37,812 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:37,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,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-28 23:19:37,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:37,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,260 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-11-28 23:19:38,514 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-11-28 23:19:38,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:38,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:39,083 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:39,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:39,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,096 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,108 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,113 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,125 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,125 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,135 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,135 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,155 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,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-28 23:19:39,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:39,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:39,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:39,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,187 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:19:39,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:19:39,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,234 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:39,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:39,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:39,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:39,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:39,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:39,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:39,293 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:39,367 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:39,416 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:39,416 INFO L444 ModelExtractionUtils]: 30 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:39,419 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:39,424 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:39,426 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:39,427 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-28 23:19:39,460 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:19:39,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:39,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:39,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:39,573 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:39,574 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:19:39,632 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 18 states and 26 transitions. Complement of second has 4 states. [2018-11-28 23:19:39,633 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-28 23:19:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2018-11-28 23:19:39,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:19:39,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:39,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:19:39,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:39,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:19:39,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:39,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 26 transitions. [2018-11-28 23:19:39,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:39,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 24 transitions. [2018-11-28 23:19:39,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:19:39,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:19:39,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 24 transitions. [2018-11-28 23:19:39,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:39,643 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 23:19:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 24 transitions. [2018-11-28 23:19:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:19:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:19:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2018-11-28 23:19:39,645 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 23:19:39,645 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2018-11-28 23:19:39,646 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:19:39,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2018-11-28 23:19:39,647 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:39,647 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:39,647 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:39,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:19:39,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:39,648 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 133#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 134#L567 assume !(main_~array_size~0 < 1); 143#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 129#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 131#L553 assume 0 == test_fun_#t~mem3;havoc test_fun_#t~mem3;test_fun_~res~0 := 1; 135#L558-2 [2018-11-28 23:19:39,648 INFO L796 eck$LassoCheckResult]: Loop: 135#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 139#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 135#L558-2 [2018-11-28 23:19:39,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:39,649 INFO L82 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2018-11-28 23:19:39,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:39,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:39,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:39,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:39,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:39,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-11-28 23:19:39,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:39,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,674 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:39,675 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:39,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:39,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:39,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:39,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:39,810 INFO L82 PathProgramCache]: Analyzing trace with hash 176795341, now seen corresponding path program 1 times [2018-11-28 23:19:39,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:39,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:39,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:39,824 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:39,828 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:39,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:39,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:39,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:39,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-28 23:19:40,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-11-28 23:19:40,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:40,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:40,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:40,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2018-11-28 23:19:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:40,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:40,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:19:40,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:19:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:19:40,138 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:19:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:40,488 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-11-28 23:19:40,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:19:40,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2018-11-28 23:19:40,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:40,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 26 transitions. [2018-11-28 23:19:40,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:19:40,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:19:40,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-28 23:19:40,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:40,498 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:19:40,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-28 23:19:40,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-28 23:19:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:19:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-11-28 23:19:40,501 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:19:40,501 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-11-28 23:19:40,501 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:19:40,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 25 transitions. [2018-11-28 23:19:40,502 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:40,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:40,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:40,503 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:40,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:40,503 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 203#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 204#L567 assume !(main_~array_size~0 < 1); 213#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 201#L553 assume !(0 == test_fun_#t~mem3);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); 205#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 209#L558-2 [2018-11-28 23:19:40,503 INFO L796 eck$LassoCheckResult]: Loop: 209#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 209#L558-2 [2018-11-28 23:19:40,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2018-11-28 23:19:40,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 2 times [2018-11-28 23:19:40,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,551 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:40,551 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:40,551 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:40,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:19:40,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:19:40,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 23:19:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:40,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1185742934, now seen corresponding path program 1 times [2018-11-28 23:19:40,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:40,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:40,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:40,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:40,635 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:40,636 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:40,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:40,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:40,881 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:19:41,010 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-28 23:19:41,428 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2018-11-28 23:19:41,773 WARN L180 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 23:19:41,777 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:41,777 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:41,777 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:41,777 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:41,777 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:41,778 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:41,778 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:41,778 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:41,778 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:19:41,778 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:41,778 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:41,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:41,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-28 23:19:41,981 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-11-28 23:19:42,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,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-28 23:19:42,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:42,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:42,474 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:42,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:42,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:42,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:42,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:42,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:42,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:42,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:42,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:42,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:42,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:42,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:42,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:42,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:42,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:42,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:42,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:42,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:42,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:42,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:42,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:42,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:42,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:42,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:42,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:42,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:42,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:42,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:42,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:42,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:42,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:42,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:42,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:42,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:42,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:42,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:42,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:42,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:42,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:42,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:42,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:42,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:42,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:42,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:42,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:42,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:42,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:42,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:42,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:42,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:42,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:42,569 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:42,580 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:42,582 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:42,583 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:42,585 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:42,585 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:42,586 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* 4 ULTIMATE.start_test_fun_~i~0) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2018-11-28 23:19:42,667 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-28 23:19:42,683 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:42,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:42,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:42,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:42,878 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:42,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:19:42,905 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 40 states and 54 transitions. Complement of second has 7 states. [2018-11-28 23:19:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:19:42,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:19:42,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:42,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 2 letters. [2018-11-28 23:19:42,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:42,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-28 23:19:42,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:42,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 54 transitions. [2018-11-28 23:19:42,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:19:42,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 35 states and 47 transitions. [2018-11-28 23:19:42,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:19:42,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:19:42,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 47 transitions. [2018-11-28 23:19:42,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:42,913 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2018-11-28 23:19:42,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 47 transitions. [2018-11-28 23:19:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-28 23:19:42,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 23:19:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-11-28 23:19:42,921 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-28 23:19:42,921 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-11-28 23:19:42,921 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:19:42,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 43 transitions. [2018-11-28 23:19:42,922 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:42,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:42,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:42,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:42,924 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:42,925 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 320#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 321#L567 assume !(main_~array_size~0 < 1); 336#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 322#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 324#L553 assume !(0 == test_fun_#t~mem3);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); 338#L555 assume test_fun_#t~mem4 < 0;havoc test_fun_#t~mem4;test_fun_~res~0 := 0; 332#L558-2 [2018-11-28 23:19:42,925 INFO L796 eck$LassoCheckResult]: Loop: 332#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 331#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 332#L558-2 [2018-11-28 23:19:42,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:42,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818447, now seen corresponding path program 1 times [2018-11-28 23:19:42,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:42,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:42,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:42,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:42,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:42,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:42,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:42,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 3 times [2018-11-28 23:19:42,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:42,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:42,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:42,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:42,966 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:42,966 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:42,966 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:42,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:19:42,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-28 23:19:42,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 23:19:42,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1185741012, now seen corresponding path program 1 times [2018-11-28 23:19:43,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:43,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,022 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:43,023 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:43,023 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:43,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:43,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:43,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-28 23:19:43,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-28 23:19:43,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 23:19:43,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:5 [2018-11-28 23:19:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:43,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:43,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:19:43,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:19:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:19:43,308 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-11-28 23:19:43,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:43,365 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-28 23:19:43,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:19:43,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2018-11-28 23:19:43,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:43,369 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 41 transitions. [2018-11-28 23:19:43,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:19:43,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:19:43,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 23:19:43,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:43,370 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 23:19:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 23:19:43,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-28 23:19:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:19:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 23:19:43,375 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:19:43,375 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:19:43,375 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:19:43,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-11-28 23:19:43,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:43,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:43,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:43,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:43,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:43,378 INFO L794 eck$LassoCheckResult]: Stem: 437#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 424#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 425#L567 assume !(main_~array_size~0 < 1); 438#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 426#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 427#L553 assume !(0 == test_fun_#t~mem3);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); 432#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 436#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 440#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 448#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 447#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 445#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 429#L553 assume !(0 == test_fun_#t~mem3);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); 430#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 434#L558-2 [2018-11-28 23:19:43,378 INFO L796 eck$LassoCheckResult]: Loop: 434#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 433#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 434#L558-2 [2018-11-28 23:19:43,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1864345184, now seen corresponding path program 1 times [2018-11-28 23:19:43,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:43,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:43,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:43,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:19:43,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 23:19:43,501 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:19:43,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 4 times [2018-11-28 23:19:43,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:43,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,506 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:43,506 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:43,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:43,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 23:19:43,522 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 23:19:43,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 23:19:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:19:43,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:19:43,699 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 6 states. [2018-11-28 23:19:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:19:43,761 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2018-11-28 23:19:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 23:19:43,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 42 transitions. [2018-11-28 23:19:43,765 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:43,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 33 states and 41 transitions. [2018-11-28 23:19:43,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:19:43,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:19:43,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2018-11-28 23:19:43,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:19:43,766 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 23:19:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2018-11-28 23:19:43,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-28 23:19:43,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-28 23:19:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-28 23:19:43,769 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-28 23:19:43,769 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-28 23:19:43,769 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:19:43,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2018-11-28 23:19:43,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:19:43,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:19:43,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:19:43,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:19:43,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:19:43,771 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 496#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet9;havoc main_#t~nondet9; 497#L567 assume !(main_~array_size~0 < 1); 511#L567-2 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.alloc(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc10.base, main_#t~malloc10.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~mem3, test_fun_#t~mem4, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~post8, test_fun_#t~mem5, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~res~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;havoc test_fun_~res~0;test_fun_~i~0 := 0; 498#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 499#L553 assume !(0 == test_fun_#t~mem3);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); 524#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 512#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 508#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 509#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 519#L558 assume !(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5; 518#L558-3 call write~int(test_fun_~res~0, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 517#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 516#L551-3 assume !!(test_fun_~i~0 < test_fun_~N);test_fun_~res~0 := 1;call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 501#L553 assume !(0 == test_fun_#t~mem3);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); 502#L555 assume !(test_fun_#t~mem4 < 0);havoc test_fun_#t~mem4; 507#L558-2 [2018-11-28 23:19:43,771 INFO L796 eck$LassoCheckResult]: Loop: 507#L558-2 call test_fun_#t~mem5 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 506#L558 assume !!(test_fun_#t~mem5 > 0);havoc test_fun_#t~mem5;call test_fun_#t~mem6 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_~res~0 := test_fun_~res~0 * test_fun_#t~mem6;havoc test_fun_#t~mem6;call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post8 := test_fun_#t~mem7;call write~int(test_fun_#t~post8 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem7;havoc test_fun_#t~post8; 507#L558-2 [2018-11-28 23:19:43,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash 221162235, now seen corresponding path program 1 times [2018-11-28 23:19:43,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:43,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,777 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:43,777 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:43,777 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:43,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 5 times [2018-11-28 23:19:43,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:19:43,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,852 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:43,852 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:43,852 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:43,866 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:19:43,872 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:19:43,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 23:19:43,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:43,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2083511360, now seen corresponding path program 2 times [2018-11-28 23:19:43,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:19:43,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:19:43,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:19:43,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:19:43,902 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-28 23:19:43,902 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 23:19:43,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 23:19:43,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:19:43,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:19:43,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-28 23:19:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:19:44,111 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-28 23:19:44,496 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 102 [2018-11-28 23:19:44,603 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 23:19:44,607 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:19:44,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:19:44,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:19:44,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:19:44,607 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:19:44,608 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:19:44,608 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:19:44,608 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:19:44,608 INFO L131 ssoRankerPreferences]: Filename of dumped script: array03-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-28 23:19:44,608 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:19:44,608 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:19:44,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,801 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-11-28 23:19:44,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:44,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:19:45,281 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:19:45,282 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:19:45,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,291 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:45,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:45,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,298 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:45,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:45,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,307 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:45,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:45,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,316 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:45,317 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:45,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:19:45,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:19:45,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:19:45,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:19:45,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:19:45,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:19:45,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:19:45,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:19:45,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:19:45,324 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:19:45,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:19:45,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:19:45,334 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:19:45,334 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:19:45,335 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:19:45,336 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:19:45,336 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:19:45,336 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* 4 ULTIMATE.start_test_fun_~i~0)))_1 Supporting invariants [] [2018-11-28 23:19:45,441 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2018-11-28 23:19:45,456 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-28 23:19:45,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:45,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:45,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:45,994 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:45,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:19:46,155 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-11-28 23:19:46,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 23:19:46,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:46,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:46,162 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:46,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:46,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:46,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:46,680 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:46,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:19:46,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 35 states and 44 transitions. Complement of second has 7 states. [2018-11-28 23:19:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:46,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-28 23:19:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:46,723 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:19:46,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:19:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:46,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:19:46,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:19:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:19:46,789 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:19:46,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12 Second operand 3 states. [2018-11-28 23:19:46,817 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 12. Second operand 3 states. Result 39 states and 50 transitions. Complement of second has 6 states. [2018-11-28 23:19:46,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:19:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:19:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-28 23:19:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 2 letters. [2018-11-28 23:19:46,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:46,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 18 letters. Loop has 2 letters. [2018-11-28 23:19:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:46,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 16 letters. Loop has 4 letters. [2018-11-28 23:19:46,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:19:46,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 50 transitions. [2018-11-28 23:19:46,824 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:46,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 0 states and 0 transitions. [2018-11-28 23:19:46,825 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:19:46,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:19:46,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:19:46,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:19:46,825 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:46,825 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:46,825 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:19:46,825 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:19:46,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:19:46,826 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:19:46,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:19:46,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:19:46 BoogieIcfgContainer [2018-11-28 23:19:46,833 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:19:46,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:19:46,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:19:46,833 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:19:46,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:19:36" (3/4) ... [2018-11-28 23:19:46,838 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:19:46,838 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:19:46,839 INFO L168 Benchmark]: Toolchain (without parser) took 11562.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 954.0 MB in the beginning and 815.4 MB in the end (delta: 138.6 MB). Peak memory consumption was 368.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:46,840 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:46,840 INFO L168 Benchmark]: CACSL2BoogieTranslator took 699.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:46,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:46,841 INFO L168 Benchmark]: Boogie Preprocessor took 49.30 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:46,842 INFO L168 Benchmark]: RCFGBuilder took 467.65 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.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:46,843 INFO L168 Benchmark]: BuchiAutomizer took 10272.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 815.4 MB in the end (delta: 292.6 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:19:46,844 INFO L168 Benchmark]: Witness Printer took 4.58 ms. Allocated memory is still 1.3 GB. Free memory is still 815.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:19:46,848 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 699.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.29 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. * Boogie Preprocessor took 49.30 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 467.65 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.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10272.67 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 81.8 MB). Free memory was 1.1 GB in the beginning and 815.4 MB in the end (delta: 292.6 MB). Peak memory consumption was 374.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.58 ms. Allocated memory is still 1.3 GB. Free memory is still 815.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][4 * i + a] 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. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.2s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 7.7s. Construction of modules took 0.5s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 119 SDtfs, 72 SDslu, 68 SDs, 0 SdLazy, 149 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital169 mio100 ax111 hnf99 lsp86 ukn68 mio100 lsp52 div100 bol100 ite100 ukn100 eq178 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms 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...