./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/array01-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 10c50c605d9fb7cd886e3d668ba568a2b619230b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:47:14,613 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:47:14,615 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:47:14,627 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:47:14,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:47:14,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:47:14,630 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:47:14,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:47:14,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:47:14,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:47:14,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:47:14,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:47:14,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:47:14,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:47:14,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:47:14,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:47:14,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:47:14,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:47:14,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:47:14,646 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:47:14,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:47:14,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:47:14,651 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:47:14,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:47:14,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:47:14,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:47:14,656 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:47:14,657 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:47:14,658 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:47:14,661 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:47:14,661 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:47:14,662 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:47:14,662 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:47:14,662 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:47:14,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:47:14,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:47:14,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:47:14,702 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:47:14,702 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:47:14,703 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:47:14,703 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:47:14,704 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:47:14,704 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:47:14,704 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:47:14,704 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:47:14,704 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:47:14,704 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:47:14,707 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:47:14,707 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:47:14,707 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:47:14,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:47:14,708 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:47:14,708 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:47:14,708 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:47:14,708 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:47:14,708 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:47:14,709 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:47:14,709 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:47:14,709 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:47:14,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:47:14,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:47:14,709 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:47:14,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:47:14,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:47:14,713 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:47:14,714 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:47:14,714 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 -> 10c50c605d9fb7cd886e3d668ba568a2b619230b [2019-01-01 21:47:14,775 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:47:14,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:47:14,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:47:14,801 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:47:14,802 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:47:14,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2019-01-01 21:47:14,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86f5f8a2/5211b055dc7749bcb7d8c8d8f8a38c64/FLAG39c05d69f [2019-01-01 21:47:15,352 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:47:15,352 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/array01-alloca_true-termination.c.i [2019-01-01 21:47:15,365 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86f5f8a2/5211b055dc7749bcb7d8c8d8f8a38c64/FLAG39c05d69f [2019-01-01 21:47:15,667 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86f5f8a2/5211b055dc7749bcb7d8c8d8f8a38c64 [2019-01-01 21:47:15,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:47:15,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:47:15,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:15,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:47:15,677 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:47:15,678 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:15" (1/1) ... [2019-01-01 21:47:15,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7367fac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:15, skipping insertion in model container [2019-01-01 21:47:15,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:47:15" (1/1) ... [2019-01-01 21:47:15,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:47:15,739 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:47:16,138 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:16,150 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:47:16,283 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:47:16,345 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:47:16,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16 WrapperNode [2019-01-01 21:47:16,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:47:16,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:16,346 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:47:16,346 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:47:16,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:47:16,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:47:16,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:47:16,398 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:47:16,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,413 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... [2019-01-01 21:47:16,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:47:16,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:47:16,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:47:16,432 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:47:16,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:16,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:47:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:47:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:47:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:47:16,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:47:16,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:47:16,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:47:16,986 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:47:16,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:16 BoogieIcfgContainer [2019-01-01 21:47:16,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:47:16,987 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:47:16,987 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:47:16,995 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:47:16,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:16,997 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:47:15" (1/3) ... [2019-01-01 21:47:17,001 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50e0fbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:17, skipping insertion in model container [2019-01-01 21:47:17,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:17,002 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:47:16" (2/3) ... [2019-01-01 21:47:17,002 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@50e0fbe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:47:17, skipping insertion in model container [2019-01-01 21:47:17,002 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:47:17,003 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:16" (3/3) ... [2019-01-01 21:47:17,008 INFO L375 chiAutomizerObserver]: Analyzing ICFG array01-alloca_true-termination.c.i [2019-01-01 21:47:17,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:47:17,111 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:47:17,111 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:47:17,111 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:47:17,111 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:47:17,112 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:47:17,112 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:47:17,112 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:47:17,112 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:47:17,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:47:17,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:17,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:17,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:17,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:47:17,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:17,159 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:47:17,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-01-01 21:47:17,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:17,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:17,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:17,162 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:47:17,162 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:47:17,173 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 10#L561true assume !(main_~array_size~0 < 1); 14#L561-2true call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 3#L551-3true [2019-01-01 21:47:17,174 INFO L796 eck$LassoCheckResult]: Loop: 3#L551-3true assume !!(test_fun_~i~0 < test_fun_~N); 12#L552-3true assume !true; 13#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 [2019-01-01 21:47:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-01-01 21:47:17,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:17,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:17,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:17,339 INFO L82 PathProgramCache]: Analyzing trace with hash 47058, now seen corresponding path program 1 times [2019-01-01 21:47:17,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:17,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:17,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:17,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:47:17,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:47:17,375 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-01 21:47:17,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-01 21:47:17,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-01 21:47:17,396 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 2 states. [2019-01-01 21:47:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:47:17,404 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-01-01 21:47:17,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:47:17,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-01 21:47:17,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:17,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2019-01-01 21:47:17,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:47:17,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:47:17,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-01 21:47:17,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:17,416 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:47:17,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-01 21:47:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:47:17,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:47:17,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-01-01 21:47:17,446 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:47:17,446 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-01 21:47:17,447 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:47:17,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2019-01-01 21:47:17,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:47:17,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:17,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:17,448 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:47:17,448 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:47:17,449 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 34#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 35#L561 assume !(main_~array_size~0 < 1); 41#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 36#L551-3 [2019-01-01 21:47:17,449 INFO L796 eck$LassoCheckResult]: Loop: 36#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 37#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 39#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 40#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 36#L551-3 [2019-01-01 21:47:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:17,449 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 2 times [2019-01-01 21:47:17,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:17,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:17,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:17,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1451916, now seen corresponding path program 1 times [2019-01-01 21:47:17,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:17,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:17,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash 176797040, now seen corresponding path program 1 times [2019-01-01 21:47:17,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:17,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:17,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:17,687 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 21:47:17,953 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:47:18,119 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 21:47:18,141 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:18,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:18,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:18,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:18,143 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:18,143 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:18,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:18,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:18,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:47:18,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:18,145 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:18,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:18,950 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 21:47:19,088 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 21:47:19,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:19,600 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-01-01 21:47:20,085 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:20,089 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:20,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 [2019-01-01 21:47:20,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:20,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,097 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:20,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:20,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,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 [2019-01-01 21:47:20,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:20,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:20,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:20,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:20,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:20,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:20,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:20,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:20,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:20,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:20,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,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 [2019-01-01 21:47:20,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,122 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:20,122 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:20,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:20,126 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:20,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:20,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:20,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:20,130 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,131 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:20,133 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:20,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:20,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,138 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:20,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:20,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:20,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 [2019-01-01 21:47:20,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:20,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:20,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:20,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:20,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:20,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:20,234 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:20,279 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:47:20,279 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:47:20,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:20,283 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:47:20,284 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:20,284 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 [] [2019-01-01 21:47:20,351 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:47:20,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:20,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:20,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:20,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:20,493 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 [2019-01-01 21:47:20,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-01 21:47:20,540 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 4 states. [2019-01-01 21:47:20,542 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 [2019-01-01 21:47:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-01 21:47:20,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:47:20,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:47:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:20,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 8 letters. [2019-01-01 21:47:20,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:20,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2019-01-01 21:47:20,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:20,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 16 transitions. [2019-01-01 21:47:20,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:47:20,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:47:20,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:47:20,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:20,550 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:47:20,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:47:20,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2019-01-01 21:47:20,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-01 21:47:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2019-01-01 21:47:20,552 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:47:20,553 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2019-01-01 21:47:20,553 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:47:20,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2019-01-01 21:47:20,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:20,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:20,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:20,554 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:47:20,554 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:20,555 INFO L794 eck$LassoCheckResult]: Stem: 117#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 115#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 116#L561 assume !(main_~array_size~0 < 1); 121#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 111#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 113#L552-3 [2019-01-01 21:47:20,555 INFO L796 eck$LassoCheckResult]: Loop: 113#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 113#L552-3 [2019-01-01 21:47:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,555 INFO L82 PathProgramCache]: Analyzing trace with hash 28695756, now seen corresponding path program 1 times [2019-01-01 21:47:20,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:20,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 1 times [2019-01-01 21:47:20,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:20,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:20,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1806818449, now seen corresponding path program 1 times [2019-01-01 21:47:20,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:20,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:20,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:20,907 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-01-01 21:47:21,222 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 21:47:21,237 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:21,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:21,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:21,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:21,238 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:21,238 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:21,238 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:21,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:21,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:47:21,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:21,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:21,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,408 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2019-01-01 21:47:21,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:21,893 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:21,893 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:21,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:21,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:21,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:21,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:21,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:21,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:21,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:21,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:21,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:21,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:21,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:21,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:21,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:21,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:21,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:21,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:21,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:21,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:21,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:21,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:21,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:21,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:21,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:21,917 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:21,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:21,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:21,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:21,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:21,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:21,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:21,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:21,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:21,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:21,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:21,937 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:21,937 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:21,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:21,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:21,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:21,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:21,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:21,984 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:21,984 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:21,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:21,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:21,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:22,000 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:47:22,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:22,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:22,009 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:47:22,009 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:22,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:22,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:22,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:22,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:22,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:22,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:22,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:22,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:22,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:22,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:22,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:22,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:22,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:22,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:22,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:22,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:22,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:22,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:22,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:22,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:22,055 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:22,055 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:47:22,056 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:22,056 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 [] [2019-01-01 21:47:22,122 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:47:22,125 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:22,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:22,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:22,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:22,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:22,257 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 [2019-01-01 21:47:22,257 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-01 21:47:22,376 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 15 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2019-01-01 21:47:22,377 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 [2019-01-01 21:47:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-01 21:47:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:47:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:47:22,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:22,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:47:22,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:22,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-01 21:47:22,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:22,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 15 states and 19 transitions. [2019-01-01 21:47:22,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:47:22,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:47:22,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-01-01 21:47:22,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:47:22,381 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-01-01 21:47:22,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-01-01 21:47:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-01 21:47:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:47:22,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-01-01 21:47:22,384 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-01 21:47:22,384 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-01-01 21:47:22,384 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:47:22,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-01-01 21:47:22,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:47:22,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:47:22,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:47:22,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:47:22,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:47:22,388 INFO L794 eck$LassoCheckResult]: Stem: 206#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet7;havoc main_#t~nondet7; 205#L561 assume !(main_~array_size~0 < 1); 210#L561-2 call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc8.base, main_#t~malloc8.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_#res;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, 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;test_fun_~res~0 := 0;test_fun_~i~0 := 0; 199#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 200#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 208#L552-1 assume !(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3; 209#L551-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 201#L551-3 assume !!(test_fun_~i~0 < test_fun_~N); 203#L552-3 [2019-01-01 21:47:22,388 INFO L796 eck$LassoCheckResult]: Loop: 203#L552-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 207#L552-1 assume !!(test_fun_#t~mem3 > 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(test_fun_#t~post5 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~res~0;test_fun_~res~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 203#L552-3 [2019-01-01 21:47:22,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:22,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1185740961, now seen corresponding path program 2 times [2019-01-01 21:47:22,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:22,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:22,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:22,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:47:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1670, now seen corresponding path program 2 times [2019-01-01 21:47:22,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:22,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:22,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:22,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1330730790, now seen corresponding path program 1 times [2019-01-01 21:47:22,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:47:22,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:47:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:22,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:47:22,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:47:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:47:22,939 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-01-01 21:47:23,006 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:47:23,006 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:47:23,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:47:23,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:47:23,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:47:23,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:47:23,007 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:47:23,007 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:47:23,007 INFO L131 ssoRankerPreferences]: Filename of dumped script: array01-alloca_true-termination.c.i_Iteration4_Lasso [2019-01-01 21:47:23,007 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:47:23,007 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:47:23,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,193 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-01 21:47:23,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:47:23,809 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:47:23,809 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:47:23,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,814 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,830 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,852 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2019-01-01 21:47:23,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,857 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-01-01 21:47:23,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,873 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,873 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,904 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:47:23,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:47:23,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:47:23,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:47:23,912 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:47:23,912 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:47:23,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:47:23,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:47:23,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:47:23,913 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:47:23,913 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:47:23,917 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:47:23,921 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:47:23,923 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:47:23,923 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:47:23,923 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:47:23,923 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:47:23,924 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 [] [2019-01-01 21:47:24,017 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-01 21:47:24,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:47:24,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:24,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:24,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:24,208 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 [2019-01-01 21:47:24,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:47:24,383 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-01-01 21:47:24,385 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 [2019-01-01 21:47:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-01 21:47:24,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:47:24,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,386 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:47:24,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:24,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:24,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:24,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:24,453 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 [2019-01-01 21:47:24,454 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:47:24,471 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 18 states and 22 transitions. Complement of second has 7 states. [2019-01-01 21:47:24,472 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 [2019-01-01 21:47:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:24,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-01 21:47:24,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:47:24,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,473 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:47:24,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:47:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:24,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:24,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:47:24,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:47:24,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:47:24,556 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 [2019-01-01 21:47:24,556 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:47:24,579 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 20 states and 26 transitions. Complement of second has 6 states. [2019-01-01 21:47:24,580 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 [2019-01-01 21:47:24,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:47:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-01-01 21:47:24,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:47:24,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-01-01 21:47:24,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-01-01 21:47:24,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:47:24,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2019-01-01 21:47:24,586 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:24,586 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 0 states and 0 transitions. [2019-01-01 21:47:24,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:47:24,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:47:24,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:47:24,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:47:24,586 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:24,586 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:24,587 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:47:24,587 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:47:24,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:47:24,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:47:24,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:47:24,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:47:24 BoogieIcfgContainer [2019-01-01 21:47:24,593 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:47:24,594 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:47:24,594 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:47:24,594 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:47:24,594 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:47:16" (3/4) ... [2019-01-01 21:47:24,598 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:47:24,598 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:47:24,599 INFO L168 Benchmark]: Toolchain (without parser) took 8927.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 951.3 MB in the beginning and 993.7 MB in the end (delta: -42.3 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:24,600 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. [2019-01-01 21:47:24,600 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:24,601 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:24,602 INFO L168 Benchmark]: Boogie Preprocessor took 30.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:24,602 INFO L168 Benchmark]: RCFGBuilder took 554.89 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.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:24,603 INFO L168 Benchmark]: BuchiAutomizer took 7605.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 993.7 MB in the end (delta: 87.7 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:47:24,604 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.2 GB. Free memory is still 993.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:47:24,609 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 672.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -149.0 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.79 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 30.26 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 554.89 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.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7605.98 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 993.7 MB in the end (delta: 87.7 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.2 GB. Free memory is still 993.7 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 4 terminating modules (1 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. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 6.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 49 SDtfs, 33 SDslu, 1 SDs, 0 SdLazy, 43 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax113 hnf99 lsp80 ukn80 mio100 lsp56 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 5 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...