./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-industry-pattern/array_ptr_single_elem_init_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/array-industry-pattern/array_ptr_single_elem_init_false-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0ddb64f0db8d8df130d0984e04e4acc66f97f5c ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:49:47,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:49:47,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:49:47,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:49:47,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:49:47,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:49:47,638 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:49:47,640 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:49:47,643 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:49:47,646 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:49:47,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:49:47,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:49:47,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:49:47,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:49:47,656 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:49:47,657 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:49:47,659 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:49:47,660 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:49:47,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:49:47,665 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:49:47,666 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:49:47,667 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:49:47,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:49:47,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:49:47,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:49:47,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:49:47,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:49:47,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:49:47,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:49:47,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:49:47,677 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:49:47,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:49:47,678 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:49:47,678 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:49:47,679 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:49:47,680 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:49:47,680 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 02:49:47,697 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:49:47,697 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:49:47,699 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:49:47,699 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:49:47,699 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:49:47,699 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:49:47,699 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:49:47,699 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:49:47,700 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:49:47,701 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:49:47,701 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:49:47,701 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:49:47,701 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 02:49:47,701 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:49:47,702 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:49:47,702 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 02:49:47,703 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:49:47,703 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:49:47,703 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:49:47,703 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:49:47,703 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 02:49:47,703 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:49:47,704 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:49:47,705 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:49:47,705 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:49:47,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:49:47,705 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:49:47,705 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:49:47,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:49:47,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:49:47,706 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:49:47,708 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:49:47,708 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0ddb64f0db8d8df130d0984e04e4acc66f97f5c [2019-01-14 02:49:47,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:49:47,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:49:47,763 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:49:47,765 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:49:47,765 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:49:47,766 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-industry-pattern/array_ptr_single_elem_init_false-unreach-call_true-termination.i [2019-01-14 02:49:47,822 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8babd7e1/da61741b310a4ef8b026a89749073382/FLAG8adc65072 [2019-01-14 02:49:48,247 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:49:48,248 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-industry-pattern/array_ptr_single_elem_init_false-unreach-call_true-termination.i [2019-01-14 02:49:48,255 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8babd7e1/da61741b310a4ef8b026a89749073382/FLAG8adc65072 [2019-01-14 02:49:48,633 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8babd7e1/da61741b310a4ef8b026a89749073382 [2019-01-14 02:49:48,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:49:48,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:49:48,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:48,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:49:48,644 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:49:48,645 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe5e0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48, skipping insertion in model container [2019-01-14 02:49:48,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:49:48,675 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:49:48,857 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:48,861 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:49:48,886 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:49:48,904 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:49:48,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48 WrapperNode [2019-01-14 02:49:48,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:49:48,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:48,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:49:48,906 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:49:48,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,921 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:49:48,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:49:48,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:49:48,944 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:49:48,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,970 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (1/1) ... [2019-01-14 02:49:48,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:49:48,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:49:48,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:49:48,973 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:49:48,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (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-14 02:49:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:49:49,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:49:49,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:49:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:49:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:49:49,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:49:49,485 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:49:49,486 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:49:49,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:49 BoogieIcfgContainer [2019-01-14 02:49:49,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:49:49,487 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:49:49,488 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:49:49,491 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:49:49,492 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:49,492 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:49:48" (1/3) ... [2019-01-14 02:49:49,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56e46977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:49, skipping insertion in model container [2019-01-14 02:49:49,493 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:49,493 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:49:48" (2/3) ... [2019-01-14 02:49:49,493 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56e46977 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:49:49, skipping insertion in model container [2019-01-14 02:49:49,494 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:49:49,494 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:49" (3/3) ... [2019-01-14 02:49:49,496 INFO L375 chiAutomizerObserver]: Analyzing ICFG array_ptr_single_elem_init_false-unreach-call_true-termination.i [2019-01-14 02:49:49,555 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:49:49,556 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:49:49,556 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:49:49,556 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:49:49,556 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:49:49,556 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:49:49,557 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:49:49,557 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:49:49,557 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:49:49,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:49:49,595 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:49:49,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:49,596 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:49,603 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:49,604 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:49,604 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:49:49,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2019-01-14 02:49:49,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-01-14 02:49:49,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:49,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:49,607 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:49,607 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:49,615 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~c~0;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0;main_~i~0 := 0; 5#L10-3true [2019-01-14 02:49:49,616 INFO L796 eck$LassoCheckResult]: Loop: 5#L10-3true assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 21#L14true assume 0 == main_~q~0;call write~int(1, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);call write~int((if main_~i~0 < 0 && 0 != main_~i~0 % 2 then main_~i~0 % 2 - 2 else main_~i~0 % 2), main_~#b~0.base, main_~#b~0.offset + 4 * main_~i~0, 4); 16#L14-2true call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 9#L19true assume !(0 != main_#t~mem2);havoc main_#t~mem2; 8#L10-2true main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 5#L10-3true [2019-01-14 02:49:49,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:49,622 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-14 02:49:49,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:49,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:49,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:49,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:49,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:49,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:49,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:49,753 INFO L82 PathProgramCache]: Analyzing trace with hash 38268879, now seen corresponding path program 1 times [2019-01-14 02:49:49,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:49,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:49,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:49,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:49,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:49,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1809708365, now seen corresponding path program 1 times [2019-01-14 02:49:49,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:49,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:49,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:49,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:49,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:50,019 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-14 02:49:50,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:50,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:49:50,416 WARN L181 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-01-14 02:49:50,636 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2019-01-14 02:49:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:49:50,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:49:50,657 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-01-14 02:49:50,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:50,943 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2019-01-14 02:49:50,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:49:50,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. [2019-01-14 02:49:50,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2019-01-14 02:49:50,953 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 18 states and 24 transitions. [2019-01-14 02:49:50,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 02:49:50,954 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 02:49:50,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 24 transitions. [2019-01-14 02:49:50,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:50,956 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2019-01-14 02:49:50,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 24 transitions. [2019-01-14 02:49:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-14 02:49:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 02:49:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-01-14 02:49:50,980 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 02:49:50,980 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-14 02:49:50,981 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:49:50,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-01-14 02:49:50,982 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 02:49:50,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:50,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:50,982 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:49:50,983 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-14 02:49:50,983 INFO L794 eck$LassoCheckResult]: Stem: 70#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 68#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~c~0;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0;main_~i~0 := 0; 61#L10-3 [2019-01-14 02:49:50,983 INFO L796 eck$LassoCheckResult]: Loop: 61#L10-3 assume !!(main_~i~0 < 100000);main_~q~0 := main_#t~nondet1;havoc main_#t~nondet1;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 62#L14 assume !(0 == main_~q~0); 71#L14-2 call main_#t~mem2 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 72#L19 assume !(0 != main_#t~mem2);havoc main_#t~mem2; 64#L10-2 main_#t~post0 := main_~i~0;main_~i~0 := 1 + main_#t~post0;havoc main_#t~post0; 61#L10-3 [2019-01-14 02:49:50,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:50,983 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-01-14 02:49:50,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:50,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:50,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:50,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:51,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:51,001 INFO L82 PathProgramCache]: Analyzing trace with hash 38328461, now seen corresponding path program 1 times [2019-01-14 02:49:51,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:51,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:51,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:49:51,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:51,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1809767947, now seen corresponding path program 1 times [2019-01-14 02:49:51,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:51,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:51,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:51,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:51,171 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-01-14 02:49:51,564 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 02:49:51,576 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:51,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:51,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:51,578 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:51,578 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:51,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:51,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:51,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:51,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_ptr_single_elem_init_false-unreach-call_true-termination.i_Iteration2_Lasso [2019-01-14 02:49:51,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:51,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:51,600 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-14 02:49:51,612 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-14 02:49:51,620 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-14 02:49:51,631 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-14 02:49:51,639 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-14 02:49:51,650 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-14 02:49:51,654 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-14 02:49:51,665 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-14 02:49:51,766 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-14 02:49:51,771 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-14 02:49:51,780 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-14 02:49:51,783 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-14 02:49:52,184 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 19 [2019-01-14 02:49:52,280 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:52,284 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:52,286 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-14 02:49:52,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:52,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:52,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:52,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:52,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:52,296 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-14 02:49:52,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:52,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:52,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:52,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:52,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:52,299 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-14 02:49:52,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:52,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,301 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:49:52,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:49:52,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:52,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:52,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:49:52,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:52,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:52,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:52,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:52,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:52,316 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-14 02:49:52,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:52,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:52,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:52,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:52,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:52,325 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-14 02:49:52,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:52,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:52,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:52,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:52,341 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-14 02:49:52,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:52,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:52,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:52,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:52,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:49:52,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:49:52,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:52,438 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:49:52,438 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-14 02:49:52,440 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:52,443 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:49:52,443 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:52,444 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~i~0 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2019-01-14 02:49:52,526 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 02:49:52,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:49:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:52,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:52,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:52,804 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-14 02:49:52,808 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-14 02:49:52,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 02:49:52,878 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 25 states and 36 transitions. Complement of second has 7 states. [2019-01-14 02:49:52,879 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-14 02:49:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:49:52,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 5 letters. [2019-01-14 02:49:52,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:52,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 5 letters. [2019-01-14 02:49:52,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:52,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 10 letters. [2019-01-14 02:49:52,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:52,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 36 transitions. [2019-01-14 02:49:52,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:52,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 23 transitions. [2019-01-14 02:49:52,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:49:52,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:49:52,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-14 02:49:52,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:52,889 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:49:52,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-14 02:49:52,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 02:49:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 02:49:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 02:49:52,892 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:49:52,892 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 02:49:52,892 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:49:52,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 02:49:52,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:49:52,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:49:52,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:49:52,894 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 02:49:52,894 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:49:52,894 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 167#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~mem2, main_#t~mem3, main_#t~post0, main_~q~0, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset, main_~#b~0.base, main_~#b~0.offset, main_~c~0;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);call main_~#b~0.base, main_~#b~0.offset := #Ultimate.allocOnStack(400000);havoc main_~c~0;main_~i~0 := 0; 159#L10-3 assume !(main_~i~0 < 100000); 157#L10-4 call write~int(1, main_~#a~0.base, 60000 + main_~#a~0.offset, 4);main_~i~0 := 0; 158#L32-3 [2019-01-14 02:49:52,894 INFO L796 eck$LassoCheckResult]: Loop: 158#L32-3 assume !!(main_~i~0 < 100000); 162#L34 assume !(15000 == main_~i~0); 166#L32-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 158#L32-3 [2019-01-14 02:49:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:52,895 INFO L82 PathProgramCache]: Analyzing trace with hash 925725, now seen corresponding path program 1 times [2019-01-14 02:49:52,895 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:52,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:52,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:52,954 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-14 02:49:52,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:49:52,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:49:52,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:49:52,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:52,957 INFO L82 PathProgramCache]: Analyzing trace with hash 71947, now seen corresponding path program 1 times [2019-01-14 02:49:52,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:49:52,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:49:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:49:52,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:49:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:49:53,015 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:53,015 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:53,015 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:53,015 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:53,016 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:49:53,016 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:53,016 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:53,016 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:53,016 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_ptr_single_elem_init_false-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 02:49:53,016 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:53,016 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:53,018 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-14 02:49:53,025 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-14 02:49:53,095 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:53,097 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:53,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:49:53,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:49:53,109 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:49:53,110 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:53,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:49:53,143 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:49:53,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:49:53,215 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:53,374 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:49:53,377 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:49:53,377 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:49:53,377 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:49:53,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:49:53,378 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:49:53,378 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:49:53,378 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:49:53,378 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:49:53,378 INFO L131 ssoRankerPreferences]: Filename of dumped script: array_ptr_single_elem_init_false-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 02:49:53,378 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:49:53,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:49:53,380 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-14 02:49:53,386 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-14 02:49:53,477 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:49:53,477 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:49:53,478 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-14 02:49:53,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:53,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:53,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:53,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:49:53,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:53,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:49:53,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:53,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:49:53,482 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-14 02:49:53,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:49:53,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:49:53,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:49:53,483 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:49:53,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:49:53,484 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:49:53,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:49:53,489 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:49:53,491 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:49:53,492 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:49:53,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:49:53,492 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:49:53,492 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:49:53,493 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 199999 Supporting invariants [] [2019-01-14 02:49:53,493 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:49:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:49:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:53,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:49:53,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:49:53,632 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-14 02:49:53,633 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-14 02:49:53,633 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:49:53,716 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 23 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 22 states and 30 transitions. Complement of second has 4 states. [2019-01-14 02:49:53,717 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-14 02:49:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:49:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2019-01-14 02:49:53,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 02:49:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 02:49:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 02:49:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:49:53,719 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 30 transitions. [2019-01-14 02:49:53,720 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:53,720 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2019-01-14 02:49:53,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:53,721 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:53,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:53,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:53,721 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:53,721 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:53,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:49:53,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:49:53,722 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-14 02:49:53,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:49:53,722 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 02:49:53,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 02:49:53,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 02:49:53,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:53,723 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 02:49:53,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:49:53,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:49:53,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:49:53,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:49:53,724 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:53,724 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:53,724 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:49:53,724 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:49:53,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:49:53,724 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:49:53,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:49:53,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:49:53 BoogieIcfgContainer [2019-01-14 02:49:53,732 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:49:53,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:49:53,733 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:49:53,733 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:49:53,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:49:49" (3/4) ... [2019-01-14 02:49:53,737 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:49:53,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:49:53,738 INFO L168 Benchmark]: Toolchain (without parser) took 5100.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 947.3 MB in the beginning and 896.9 MB in the end (delta: 50.5 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:53,740 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:53,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.17 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:53,741 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.93 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:53,742 INFO L168 Benchmark]: Boogie Preprocessor took 29.07 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:53,743 INFO L168 Benchmark]: RCFGBuilder took 514.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:53,744 INFO L168 Benchmark]: BuchiAutomizer took 4244.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.9 MB in the end (delta: 222.4 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:49:53,745 INFO L168 Benchmark]: Witness Printer took 5.26 ms. Allocated memory is still 1.2 GB. Free memory is still 896.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:49:53,751 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.17 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.93 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.07 ms. Allocated memory is still 1.0 GB. Free memory was 936.6 MB in the beginning and 931.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 514.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -188.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4244.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 896.9 MB in the end (delta: 222.4 MB). Peak memory consumption was 222.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.26 ms. Allocated memory is still 1.2 GB. Free memory is still 896.9 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 #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -8 * i + 199999 * unknown-#length-unknown[a] and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 199999 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 34 SDtfs, 62 SDslu, 28 SDs, 0 SdLazy, 65 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT1 lasso1 LassoPreprocessingBenchmarks: Lassos: inital50 mio100 ax100 hnf100 lsp95 ukn86 mio100 lsp84 div100 bol100 ite100 ukn100 eq165 hnf94 smp100 dnf153 smp91 tf105 neg91 sie130 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...