./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c --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-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c -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 7c08193784b646afd298f73ae6296b7af2e0cac1 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:33:50,626 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:50,628 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:50,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:50,643 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:50,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:50,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:50,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:50,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:50,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:50,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:50,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:50,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:50,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:50,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:50,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:50,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:50,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:50,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:50,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:50,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:50,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:50,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:50,668 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:50,668 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:50,669 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:50,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:50,671 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:50,672 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:50,673 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:50,673 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:50,674 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:50,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:50,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:50,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:50,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:50,676 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:33:50,702 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:50,704 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:50,705 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:50,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:50,707 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:50,707 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:50,707 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:50,708 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:50,708 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:50,708 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:50,708 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:50,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:50,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:50,709 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:50,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:50,709 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:50,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:50,709 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:50,710 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:50,712 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:50,712 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:50,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:50,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:50,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:50,713 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:50,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:50,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:50,714 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:50,718 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:50,718 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 -> 7c08193784b646afd298f73ae6296b7af2e0cac1 [2019-01-01 21:33:50,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:50,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:50,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:50,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:50,806 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:50,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:50,886 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb18cd08/708917cf7c1a4f91b15a464230fe2dc7/FLAG6bfa17274 [2019-01-01 21:33:51,418 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:51,419 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:51,427 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb18cd08/708917cf7c1a4f91b15a464230fe2dc7/FLAG6bfa17274 [2019-01-01 21:33:51,801 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb18cd08/708917cf7c1a4f91b15a464230fe2dc7 [2019-01-01 21:33:51,805 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:51,806 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:51,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:51,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:51,812 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:51,813 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@616d4d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:51, skipping insertion in model container [2019-01-01 21:33:51,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:51" (1/1) ... [2019-01-01 21:33:51,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:51,853 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:52,082 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:52,088 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:52,111 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:52,129 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:52,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52 WrapperNode [2019-01-01 21:33:52,130 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:52,132 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:52,132 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:52,132 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:52,144 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:33:52" (1/1) ... [2019-01-01 21:33:52,150 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:33:52" (1/1) ... [2019-01-01 21:33:52,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:52,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:52,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:52,180 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:52,192 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,193 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (1/1) ... [2019-01-01 21:33:52,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:52,213 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:52,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:52,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:52,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (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:33:52,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:52,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:52,697 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:52,697 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:33:52,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:52 BoogieIcfgContainer [2019-01-01 21:33:52,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:52,699 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:52,699 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:52,704 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:52,705 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:52,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:51" (1/3) ... [2019-01-01 21:33:52,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b32f7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:52, skipping insertion in model container [2019-01-01 21:33:52,707 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:52,707 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:52" (2/3) ... [2019-01-01 21:33:52,708 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b32f7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:52, skipping insertion in model container [2019-01-01 21:33:52,708 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:52,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:52" (3/3) ... [2019-01-01 21:33:52,711 INFO L375 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:52,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:52,859 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:52,859 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:52,859 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:52,860 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:52,860 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:52,860 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:52,860 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:52,861 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:52,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:52,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:52,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:52,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:52,940 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:52,940 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:52,940 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:52,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:52,942 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:52,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:52,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:52,943 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:52,943 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:52,953 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L19-2true [2019-01-01 21:33:52,954 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 9#L21-2true assume !(main_~j~0 <= main_~i~0); 8#L21-3true main_~i~0 := 1 + main_~i~0; 6#L19-2true [2019-01-01 21:33:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:33:52,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:52,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:53,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:53,080 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-01 21:33:53,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:53,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:53,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:53,099 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-01 21:33:53,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:53,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:53,250 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:53,252 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:53,252 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:53,252 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:53,253 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:53,253 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,253 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:53,253 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:53,253 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:53,253 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:53,254 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:53,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:33:53,309 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:33:53,327 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:33:53,528 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:53,529 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) [2019-01-01 21:33:53,543 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,543 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:53,592 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} 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-01 21:33:53,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:53,643 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:53,643 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-01 21:33:53,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:53,656 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:33:53,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:53,705 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,892 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:53,895 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:53,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:53,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:53,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:53,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:53,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:53,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:53,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:53,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:53,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:53,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:53,903 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:33:53,921 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:33:53,926 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:33:54,337 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:54,344 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:54,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:54,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:54,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:54,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:54,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:54,356 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:54,356 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:54,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:54,370 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:33:54,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:54,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:54,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:54,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:54,375 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:54,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:54,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:54,384 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:33:54,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:54,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:54,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:54,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:54,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:54,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:54,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:54,399 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:54,412 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:33:54,412 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:33:54,415 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:54,415 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:54,416 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:54,416 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:33:54,418 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:54,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:54,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:54,692 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:33:54,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:33:54,711 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-01 21:33:54,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 30 states and 48 transitions. Complement of second has 9 states. [2019-01-01 21:33:54,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:54,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-01-01 21:33:54,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:33:54,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:33:54,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:33:54,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:54,860 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 48 transitions. [2019-01-01 21:33:54,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:54,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2019-01-01 21:33:54,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:54,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:54,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-01-01 21:33:54,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:54,871 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-01 21:33:54,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-01-01 21:33:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 21:33:54,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:54,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:54,901 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:54,901 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:54,901 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:54,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-01 21:33:54,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:54,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:54,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:54,903 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:54,903 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:33:54,903 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 83#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 85#L21-2 [2019-01-01 21:33:54,904 INFO L796 eck$LassoCheckResult]: Loop: 85#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 91#L21-2 assume !(main_~j~0 <= main_~i~0); 88#L21-3 main_~i~0 := 1 + main_~i~0; 84#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 85#L21-2 [2019-01-01 21:33:54,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:33:54,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:54,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:54,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1506610, now seen corresponding path program 1 times [2019-01-01 21:33:54,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:54,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:54,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:54,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:54,929 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 1 times [2019-01-01 21:33:54,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:54,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:54,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:54,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:55,052 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:55,053 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:55,053 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:55,053 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:55,053 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:55,053 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,054 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:55,054 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:55,054 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:55,054 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:55,054 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:55,056 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:33:55,069 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:33:55,074 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:33:55,214 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:55,215 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,244 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:55,245 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,250 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,271 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:55,271 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:55,278 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,306 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:55,306 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:55,445 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:55,449 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:55,449 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:55,449 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:55,449 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:55,450 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:55,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:55,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:55,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:55,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:55,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:55,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:55,452 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:33:55,461 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:33:55,468 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:33:55,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:55,644 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:55,645 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:33:55,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:55,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:55,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:55,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:55,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:55,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:55,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:55,654 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:33:55,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:55,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:55,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:55,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:55,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:55,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:55,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:55,667 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:33:55,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:55,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:55,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:55,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:55,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:55,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:55,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:55,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:55,691 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:55,691 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:55,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:55,692 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:55,692 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:55,692 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:33:55,694 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:55,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:55,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:55,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:33:55,971 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:33:55,971 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 21:33:56,267 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 22 states and 31 transitions. Complement of second has 6 states. [2019-01-01 21:33:56,269 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:33:56,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:33:56,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:56,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:33:56,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:33:56,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-01-01 21:33:56,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:56,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 15 states and 22 transitions. [2019-01-01 21:33:56,278 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:33:56,278 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:56,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2019-01-01 21:33:56,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:56,278 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-01 21:33:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2019-01-01 21:33:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-01 21:33:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:33:56,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-01 21:33:56,284 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-01 21:33:56,285 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-01 21:33:56,285 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:56,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2019-01-01 21:33:56,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:56,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:56,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:56,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:33:56,288 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:56,289 INFO L794 eck$LassoCheckResult]: Stem: 157#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 158#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 159#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 163#L21-2 [2019-01-01 21:33:56,290 INFO L796 eck$LassoCheckResult]: Loop: 163#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 163#L21-2 [2019-01-01 21:33:56,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,290 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-01 21:33:56,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:56,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 21:33:56,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,332 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2019-01-01 21:33:56,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:56,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,378 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:56,378 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:56,378 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:56,378 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:56,378 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:56,379 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,379 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:56,379 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:56,379 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:56,379 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:56,379 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:56,382 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:33:56,396 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:33:56,420 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:33:56,527 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:56,527 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,553 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:56,553 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:56,559 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:56,593 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:56,738 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:56,740 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:56,741 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:56,741 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:56,741 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:56,741 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:56,741 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:56,741 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:56,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:56,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:56,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:56,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:56,744 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:33:56,767 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:33:56,790 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:33:56,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:56,843 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:56,843 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:33:56,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:56,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:56,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:56,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:56,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:56,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:56,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:56,854 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:33:56,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:56,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:56,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:56,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:56,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:56,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:56,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:56,860 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:56,863 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:56,864 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:56,864 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:56,864 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:56,865 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:56,865 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-01 21:33:56,865 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:56,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:56,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:56,924 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:33:56,924 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:56,924 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10 Second operand 2 states. [2019-01-01 21:33:56,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 26 states and 38 transitions. Complement of second has 5 states. [2019-01-01 21:33:56,947 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:33:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:56,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:33:56,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 21:33:56,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:33:56,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:56,950 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. [2019-01-01 21:33:56,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:56,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 33 transitions. [2019-01-01 21:33:56,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:56,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:56,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2019-01-01 21:33:56,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:56,953 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2019-01-01 21:33:56,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2019-01-01 21:33:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2019-01-01 21:33:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-01 21:33:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2019-01-01 21:33:56,958 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-01 21:33:56,958 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2019-01-01 21:33:56,958 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:56,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2019-01-01 21:33:56,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:56,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:56,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:56,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-01-01 21:33:56,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:56,965 INFO L794 eck$LassoCheckResult]: Stem: 229#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 230#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 232#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 236#L21-2 assume !(main_~j~0 <= main_~i~0); 245#L21-3 main_~i~0 := 1 + main_~i~0; 243#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 239#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 238#L21-2 [2019-01-01 21:33:56,965 INFO L796 eck$LassoCheckResult]: Loop: 238#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 238#L21-2 [2019-01-01 21:33:56,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 2 times [2019-01-01 21:33:56,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:56,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:56,996 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-01 21:33:56,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:56,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:56,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash 780807227, now seen corresponding path program 3 times [2019-01-01 21:33:57,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:57,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:57,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:57,081 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:57,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:57,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:57,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:57,081 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:57,082 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,082 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:57,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:57,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:57,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:57,083 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:57,084 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:33:57,097 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:33:57,101 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:33:57,158 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:57,158 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:57,164 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:57,188 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:57,328 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:57,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:57,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:57,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:57,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:57,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:57,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:57,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:57,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:57,331 INFO L131 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:57,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:57,332 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:57,333 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:33:57,352 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:33:57,359 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:33:57,483 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:57,484 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:57,484 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:33:57,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:57,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:57,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:57,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:57,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:57,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:57,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:57,490 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:57,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:57,497 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:57,498 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:57,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:57,499 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:57,499 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2019-01-01 21:33:57,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:57,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,554 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:33:57,555 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:57,555 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-01 21:33:57,571 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 24 states and 35 transitions. Complement of second has 5 states. [2019-01-01 21:33:57,572 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:33:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:57,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-01 21:33:57,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,574 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:57,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,625 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:33:57,625 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 21:33:57,625 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-01 21:33:57,639 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 24 states and 35 transitions. Complement of second has 5 states. [2019-01-01 21:33:57,642 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:33:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:57,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:57,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-01 21:33:57,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,643 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:57,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:57,675 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:33:57,676 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 1 loop predicates [2019-01-01 21:33:57,676 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-01 21:33:57,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2019-01-01 21:33:57,692 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:33:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:33:57,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2019-01-01 21:33:57,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-01 21:33:57,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:33:57,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:57,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. [2019-01-01 21:33:57,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:57,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2019-01-01 21:33:57,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:57,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:57,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:57,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:57,696 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:57,697 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:57,697 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:57,697 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:57,697 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:57,697 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:57,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:57,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:57 BoogieIcfgContainer [2019-01-01 21:33:57,707 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:57,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:57,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:57,708 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:57,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:52" (3/4) ... [2019-01-01 21:33:57,712 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:57,713 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:57,714 INFO L168 Benchmark]: Toolchain (without parser) took 5908.30 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 946.0 MB in the beginning and 846.0 MB in the end (delta: 100.0 MB). Peak memory consumption was 200.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,716 INFO L168 Benchmark]: CDTParser took 0.20 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-01 21:33:57,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.31 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 933.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.32 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:57,718 INFO L168 Benchmark]: Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:57,718 INFO L168 Benchmark]: RCFGBuilder took 485.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,720 INFO L168 Benchmark]: BuchiAutomizer took 5008.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 846.0 MB in the end (delta: 239.1 MB). Peak memory consumption was 239.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:57,721 INFO L168 Benchmark]: Witness Printer took 5.33 ms. Allocated memory is still 1.1 GB. Free memory is still 846.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:57,726 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.20 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 323.31 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 933.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.32 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.56 ms. Allocated memory is still 1.0 GB. Free memory is still 933.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 485.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -151.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5008.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 846.0 MB in the end (delta: 239.1 MB). Peak memory consumption was 239.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.33 ms. Allocated memory is still 1.1 GB. Free memory is still 846.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 6 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.4s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 26 SDtfs, 32 SDslu, 9 SDs, 0 SdLazy, 50 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax191 hnf99 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf110 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...