./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-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/AliasDarteFeautrierGonnord-SAS2010-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 e334a37fa3ef1f2b757af8cdc97575f5cde09f8b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25,017 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:25,022 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:25,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:25,051 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:25,053 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:25,056 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:25,059 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:25,061 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:25,062 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:25,063 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:25,064 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:25,065 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:25,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:25,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:25,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:25,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:25,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:25,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:25,077 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:25,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:25,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:25,083 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:25,084 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:25,084 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:25,085 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:25,087 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:25,088 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:25,089 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:25,091 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:25,091 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:25,092 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:25,092 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:25,092 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:25,093 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:25,095 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:25,095 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:25,117 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:25,117 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:25,119 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:25,119 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:25,120 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:25,120 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:25,120 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:25,120 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:25,120 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:25,120 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:25,122 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:25,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:25,122 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:25,122 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:25,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:25,123 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:25,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:25,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:25,123 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:25,123 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:25,123 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:25,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:25,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:25,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:25,125 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:25,125 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:25,126 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:25,126 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:25,128 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:25,128 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 -> e334a37fa3ef1f2b757af8cdc97575f5cde09f8b [2019-01-01 21:33:25,170 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:25,184 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:25,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:25,190 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:25,191 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:25,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:25,271 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9661035b/11a2666ee64e432c903fc57e37bcca29/FLAGe391ec425 [2019-01-01 21:33:25,829 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:25,830 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:25,838 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9661035b/11a2666ee64e432c903fc57e37bcca29/FLAGe391ec425 [2019-01-01 21:33:26,182 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9661035b/11a2666ee64e432c903fc57e37bcca29 [2019-01-01 21:33:26,186 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:26,188 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:26,192 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:26,192 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:26,197 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:26,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d4e13c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26, skipping insertion in model container [2019-01-01 21:33:26,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:26" (1/1) ... [2019-01-01 21:33:26,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:26,242 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:26,461 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:26,467 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:26,488 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:26,506 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:26,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26 WrapperNode [2019-01-01 21:33:26,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:26,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:26,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:26,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:26,520 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:26" (1/1) ... [2019-01-01 21:33:26,527 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:26" (1/1) ... [2019-01-01 21:33:26,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:26,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:26,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:26,553 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:26,566 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:26" (1/1) ... [2019-01-01 21:33:26,566 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:26" (1/1) ... [2019-01-01 21:33:26,567 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:26" (1/1) ... [2019-01-01 21:33:26,567 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:26" (1/1) ... [2019-01-01 21:33:26,571 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:26" (1/1) ... [2019-01-01 21:33:26,577 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:26" (1/1) ... [2019-01-01 21:33:26,579 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:26" (1/1) ... [2019-01-01 21:33:26,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:26,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:26,582 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:26,582 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:26,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (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:26,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:26,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:26,937 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:26,938 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:33:26,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:26 BoogieIcfgContainer [2019-01-01 21:33:26,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:26,939 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:26,939 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:26,943 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:26,944 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:26,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:26" (1/3) ... [2019-01-01 21:33:26,946 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b92fd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:26, skipping insertion in model container [2019-01-01 21:33:26,946 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:26,946 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:26" (2/3) ... [2019-01-01 21:33:26,947 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b92fd60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:26, skipping insertion in model container [2019-01-01 21:33:26,947 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:26,947 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:26" (3/3) ... [2019-01-01 21:33:26,949 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c [2019-01-01 21:33:27,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:27,041 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:27,041 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:27,041 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:27,042 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:27,042 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:27,042 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:27,042 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:27,043 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:27,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:33:27,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:27,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:27,151 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:27,160 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:27,160 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:27,160 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:27,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:33:27,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:27,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:27,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:27,163 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:27,163 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:27,178 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 5#L18-2true [2019-01-01 21:33:27,179 INFO L796 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 11#L19true assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 7#L19-2true main_~y~0 := main_~y~0 - 1; 5#L18-2true [2019-01-01 21:33:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:33:27,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:27,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:27,322 INFO L82 PathProgramCache]: Analyzing trace with hash 40299, now seen corresponding path program 1 times [2019-01-01 21:33:27,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:27,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:27,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash 963820, now seen corresponding path program 1 times [2019-01-01 21:33:27,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:27,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:27,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:27,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:27,464 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:27,465 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:27,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:27,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:27,466 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:27,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:27,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:27,467 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:27,468 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:27,468 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:27,468 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:27,498 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:27,529 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:27,542 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:27,549 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:27,563 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:28,110 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:28,111 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:28,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:28,125 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:28,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:28,165 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe 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:28,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:28,173 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:28,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:28,197 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:28,213 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:28,213 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:28,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:28,264 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:28,276 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:28,293 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:28,293 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2019-01-01 21:33:28,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:28,340 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:33:28,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:28,402 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:28,451 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:28,454 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:28,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:28,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:28,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:28,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:28,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:28,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:28,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:28,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:28,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:28,455 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:28,459 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:28,470 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:28,480 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:28,486 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:28,493 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:28,688 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:28,694 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:28,697 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:28,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:28,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:28,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:28,716 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:28,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,722 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:28,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:28,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:28,733 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:28,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:28,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:28,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:28,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:28,740 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:28,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:28,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:28,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:28,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:28,747 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:28,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:28,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:28,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:28,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:28,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:28,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:28,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:28,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:28,764 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:28,764 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:28,767 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:28,768 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:28,768 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:28,769 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-01-01 21:33:28,771 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:28,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:28,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:28,974 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:28,992 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:28,993 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 3 states. [2019-01-01 21:33:29,186 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 3 states. Result 37 states and 54 transitions. Complement of second has 8 states. [2019-01-01 21:33:29,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:29,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-01-01 21:33:29,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:33:29,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:29,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:33:29,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:29,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:33:29,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:29,197 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2019-01-01 21:33:29,202 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:29,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 14 states and 20 transitions. [2019-01-01 21:33:29,209 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:33:29,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:33:29,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-01-01 21:33:29,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:29,210 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:33:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-01-01 21:33:29,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-01 21:33:29,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:33:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-01-01 21:33:29,244 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:33:29,245 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-01-01 21:33:29,245 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:29,245 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-01-01 21:33:29,246 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:29,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:29,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:29,247 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:33:29,247 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:29,248 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 93#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 91#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 98#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2019-01-01 21:33:29,248 INFO L796 eck$LassoCheckResult]: Loop: 99#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2019-01-01 21:33:29,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:29,249 INFO L82 PathProgramCache]: Analyzing trace with hash 963347, now seen corresponding path program 1 times [2019-01-01 21:33:29,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:29,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:29,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:29,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2019-01-01 21:33:29,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:29,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:29,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash 29863779, now seen corresponding path program 2 times [2019-01-01 21:33:29,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:29,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:29,360 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:29,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:29,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:29,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:29,361 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:29,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:29,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:29,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:29,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:29,362 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:29,364 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:29,369 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:29,379 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:29,387 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:29,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:29,496 INFO L412 LassoAnalysis]: Checking for nontermination... 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:29,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:29,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:29,524 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:29,524 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 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:29,530 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:29,530 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:29,552 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:29,553 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 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:29,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:29,560 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:29,573 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:29,574 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} 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:29,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:29,611 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:29,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:29,639 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:29,888 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:29,892 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:29,893 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:29,893 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:29,893 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:29,893 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:29,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:29,894 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:29,894 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:29,894 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:29,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:29,894 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:29,896 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:29,937 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:29,979 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:30,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:30,318 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:30,318 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:30,319 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:30,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:30,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:30,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:30,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:30,323 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:30,324 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:30,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:30,332 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:30,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:30,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:30,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:30,333 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:30,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:30,335 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:30,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:30,342 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:30,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:30,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:30,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:30,343 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:33:30,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:30,344 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:33:30,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:30,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:30,349 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:30,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:30,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:30,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:30,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:30,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:30,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:30,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:30,356 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:30,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:30,361 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:30,362 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:30,362 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:30,362 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:30,362 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-01-01 21:33:30,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:30,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:30,499 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:30,500 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:30,500 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 2 states. [2019-01-01 21:33:30,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 2 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2019-01-01 21:33:30,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-01-01 21:33:30,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 21:33:30,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-01 21:33:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:30,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:30,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-01-01 21:33:30,526 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:30,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-01-01 21:33:30,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-01 21:33:30,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-01 21:33:30,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-01-01 21:33:30,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:30,528 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-01-01 21:33:30,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-01-01 21:33:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-01-01 21:33:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:33:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-01-01 21:33:30,531 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-01-01 21:33:30,531 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-01-01 21:33:30,531 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:30,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2019-01-01 21:33:30,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:30,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:30,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:30,535 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:33:30,536 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:33:30,536 INFO L794 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 163#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 168#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 177#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 176#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2019-01-01 21:33:30,536 INFO L796 eck$LassoCheckResult]: Loop: 169#L20-3 main_~x~0 := main_~x~0 - 1; 170#L19-2 main_~y~0 := main_~y~0 - 1; 164#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 165#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 173#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2019-01-01 21:33:30,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,537 INFO L82 PathProgramCache]: Analyzing trace with hash 29863777, now seen corresponding path program 1 times [2019-01-01 21:33:30,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:30,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:30,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:30,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,556 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 1 times [2019-01-01 21:33:30,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:30,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:30,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267692, now seen corresponding path program 1 times [2019-01-01 21:33:30,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:30,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:30,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:30,871 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-01 21:33:30,873 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:30,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:30,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:30,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:30,873 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:30,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:30,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:30,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:30,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:30,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:30,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:30,878 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:30,897 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:30,905 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:30,912 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:30,917 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:31,089 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:31,089 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:31,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:31,094 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:31,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:31,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:31,250 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:31,253 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:31,253 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:31,253 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:31,253 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:31,253 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:31,254 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:31,254 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:31,254 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:31,254 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:31,254 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:31,254 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:31,257 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:31,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:31,285 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:31,293 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:31,296 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:31,521 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:31,522 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:31,522 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:31,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:31,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:31,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:31,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:33:31,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:31,525 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:33:31,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:31,543 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:31,551 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:31,552 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:31,553 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:31,553 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:31,553 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:31,553 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:33:31,555 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:31,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:31,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:31,686 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:31,687 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:31,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-01-01 21:33:31,731 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 46 states and 68 transitions. Complement of second has 8 states. [2019-01-01 21:33:31,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:33:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-01 21:33:31,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 5 letters. [2019-01-01 21:33:31,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:31,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 21:33:31,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:31,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-01 21:33:31,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:31,737 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2019-01-01 21:33:31,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:31,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 32 states and 46 transitions. [2019-01-01 21:33:31,742 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:33:31,742 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-01 21:33:31,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2019-01-01 21:33:31,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:31,743 INFO L705 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-01-01 21:33:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2019-01-01 21:33:31,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-01 21:33:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-01 21:33:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-01-01 21:33:31,748 INFO L728 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-01-01 21:33:31,748 INFO L608 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-01-01 21:33:31,748 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:31,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2019-01-01 21:33:31,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:31,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:31,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:31,751 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-01 21:33:31,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-01-01 21:33:31,752 INFO L794 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 280#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 281#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 295#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 288#L20-3 main_~x~0 := main_~x~0 - 1; 289#L19-2 main_~y~0 := main_~y~0 - 1; 292#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 305#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 304#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 302#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2019-01-01 21:33:31,752 INFO L796 eck$LassoCheckResult]: Loop: 298#L20-3 main_~x~0 := main_~x~0 - 1; 290#L19-2 main_~y~0 := main_~y~0 - 1; 291#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 299#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 294#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2019-01-01 21:33:31,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:31,752 INFO L82 PathProgramCache]: Analyzing trace with hash -363863338, now seen corresponding path program 2 times [2019-01-01 21:33:31,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:31,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:31,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:31,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:31,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:33:31,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:31,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 21:33:31,826 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:31,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:31,827 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 2 times [2019-01-01 21:33:31,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:31,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:31,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:31,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:31,905 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:31,905 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:31,905 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:31,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:31,907 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:31,907 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:31,907 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:31,907 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:31,907 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:31,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:31,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:31,912 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:31,917 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:31,966 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:31,973 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:31,977 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:32,136 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:32,137 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 21:33:32,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:32,144 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:32,152 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=7} Honda state: {ULTIMATE.start_main_#t~nondet1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:32,178 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,205 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:32,205 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:32,247 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:32,249 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:32,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:32,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:32,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:32,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:32,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:32,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:32,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:32,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:32,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:32,254 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:32,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:32,282 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:32,292 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:32,297 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:32,404 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:32,405 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:32,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:33:32,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:32,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:33:32,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,412 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:33:32,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:32,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:32,417 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:32,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:32,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:32,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:32,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:32,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:32,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:32,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:32,422 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:32,425 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:32,425 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:32,426 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:32,426 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:32,426 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:32,426 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-01-01 21:33:32,427 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:32,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:32,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:32,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:32,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:32,554 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:32,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-01-01 21:33:32,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 80 states and 118 transitions. Complement of second has 7 states. [2019-01-01 21:33:32,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:32,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-01-01 21:33:32,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. [2019-01-01 21:33:32,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:32,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 15 letters. Loop has 5 letters. [2019-01-01 21:33:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:32,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 10 letters. [2019-01-01 21:33:32,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:32,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 118 transitions. [2019-01-01 21:33:32,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:33:32,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 54 states and 78 transitions. [2019-01-01 21:33:32,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-01 21:33:32,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-01 21:33:32,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 78 transitions. [2019-01-01 21:33:32,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:32,604 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2019-01-01 21:33:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 78 transitions. [2019-01-01 21:33:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-01-01 21:33:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:33:32,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2019-01-01 21:33:32,609 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2019-01-01 21:33:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:33:32,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:33:32,614 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2019-01-01 21:33:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:32,647 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2019-01-01 21:33:32,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:33:32,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-01-01 21:33:32,649 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:33:32,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 46 transitions. [2019-01-01 21:33:32,651 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-01 21:33:32,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-01 21:33:32,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-01-01 21:33:32,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:32,652 INFO L705 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-01-01 21:33:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-01-01 21:33:32,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-01 21:33:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 21:33:32,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-01-01 21:33:32,655 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-01-01 21:33:32,655 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-01-01 21:33:32,655 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:32,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2019-01-01 21:33:32,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:33:32,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:32,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:32,658 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-01-01 21:33:32,658 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:32,658 INFO L794 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 538#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 539#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 551#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 559#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 546#L20-3 main_~x~0 := main_~x~0 - 1; 547#L19-2 main_~y~0 := main_~y~0 - 1; 567#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 565#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 549#L20-2 [2019-01-01 21:33:32,658 INFO L796 eck$LassoCheckResult]: Loop: 549#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 549#L20-2 [2019-01-01 21:33:32,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:32,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1840994920, now seen corresponding path program 3 times [2019-01-01 21:33:32,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:32,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:32,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:32,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:32,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:32,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2019-01-01 21:33:32,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:32,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:32,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:32,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:32,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267694, now seen corresponding path program 4 times [2019-01-01 21:33:32,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:32,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:32,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:32,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:32,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:32,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:32,767 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:32,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:32,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:32,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:32,767 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:32,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:32,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:32,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:33:32,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:32,768 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:32,769 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:32,787 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:32,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:32,795 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:32,859 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:32,859 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:32,865 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:32,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:32,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:33,062 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:33,065 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:33,065 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:33,065 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:33,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:33,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:33,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:33,066 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:33,066 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration5_Loop [2019-01-01 21:33:33,066 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:33,066 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:33,068 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:33,085 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:33,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:33,093 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:33,155 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:33,156 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:33,157 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:33,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:33,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:33,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:33,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:33,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:33,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:33,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:33,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:33,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:33,169 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:33,169 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:33,170 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:33,170 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:33,170 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-01-01 21:33:33,170 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:33,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:33,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,208 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:33,208 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:33,208 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-01-01 21:33:33,223 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2019-01-01 21:33:33,227 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:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:33,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-01 21:33:33,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,228 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:33,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:33,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,278 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:33,279 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:33,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-01-01 21:33:33,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2019-01-01 21:33:33,290 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:33,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:33,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:33,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-01 21:33:33,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,291 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,317 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:33,318 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:33,318 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-01-01 21:33:33,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 38 states and 54 transitions. Complement of second has 4 states. [2019-01-01 21:33:33,335 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:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-01-01 21:33:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-01 21:33:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-01 21:33:33,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:33:33,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:33,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2019-01-01 21:33:33,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:33,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 37 transitions. [2019-01-01 21:33:33,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:33,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:33,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-01-01 21:33:33,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:33,341 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-01 21:33:33,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-01-01 21:33:33,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-01-01 21:33:33,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-01 21:33:33,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-01-01 21:33:33,343 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-01 21:33:33,343 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-01-01 21:33:33,344 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 21:33:33,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-01-01 21:33:33,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:33,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:33,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:33,345 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2019-01-01 21:33:33,345 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:33,346 INFO L794 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 799#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 806#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 803#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 804#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 802#L20-3 main_~x~0 := main_~x~0 - 1; 801#L19-2 main_~y~0 := main_~y~0 - 1; 796#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 797#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 807#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 810#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 813#L20-3 main_~x~0 := main_~x~0 - 1; 812#L19-2 main_~y~0 := main_~y~0 - 1; 811#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 808#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2019-01-01 21:33:33,346 INFO L796 eck$LassoCheckResult]: Loop: 800#L19-2 main_~y~0 := main_~y~0 - 1; 794#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 795#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2019-01-01 21:33:33,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1970756676, now seen corresponding path program 1 times [2019-01-01 21:33:33,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:33,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:33,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:33,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:33,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:33,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:33,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 2 times [2019-01-01 21:33:33,370 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:33,370 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:33,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:33,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:33,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:33,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1390830772, now seen corresponding path program 2 times [2019-01-01 21:33:33,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:33,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:33,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:33,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 21:33:33,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:33:33,439 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:33:33,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:33:33,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:33:33,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:33:33,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 21:33:33,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:33:33,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 21:33:33,572 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:33,572 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:33,572 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:33,572 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:33,572 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:33,572 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:33,573 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:33,573 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:33:33,573 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:33,573 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:33,574 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:33,579 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:33,583 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:33,587 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:33,595 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:33,658 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:33,658 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,665 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:33,665 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:33,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:33,692 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:33,697 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:33,722 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:33,723 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,727 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:33,728 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:33,730 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:33,731 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:33,752 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,775 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:33,775 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:33,815 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:33,816 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:33,817 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:33,817 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:33,817 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:33,817 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:33,817 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:33,817 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:33,817 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:33,817 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration6_Loop [2019-01-01 21:33:33,817 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:33,817 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:33,819 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:33,824 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:33,833 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:33,842 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:33,851 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:33,953 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:33,953 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:33,955 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:33,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:33,956 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:33,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:33,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:33,957 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:33,957 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:33,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:33,961 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:33,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:33,961 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:33,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:33,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:33,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:33,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:33,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:33,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:33,963 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:33,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:33,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:33,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:33,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:33,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:33,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:33,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:33,966 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:33,968 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:33,968 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:33,969 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:33,969 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:33,969 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:33,969 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:33:33,969 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:34,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,088 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:34,089 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:34,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 21:33:34,134 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 63 states and 85 transitions. Complement of second has 7 states. [2019-01-01 21:33:34,135 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:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:33:34,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 21:33:34,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:34,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 21:33:34,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:34,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 6 letters. [2019-01-01 21:33:34,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:34,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 85 transitions. [2019-01-01 21:33:34,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:34,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 44 states and 59 transitions. [2019-01-01 21:33:34,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:34,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:34,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2019-01-01 21:33:34,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:34,140 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-01-01 21:33:34,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2019-01-01 21:33:34,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-01 21:33:34,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-01 21:33:34,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-01-01 21:33:34,143 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-01 21:33:34,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:33:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:33:34,143 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 5 states. [2019-01-01 21:33:34,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:34,180 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-01-01 21:33:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 21:33:34,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2019-01-01 21:33:34,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:34,186 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 45 states and 58 transitions. [2019-01-01 21:33:34,186 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:34,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:34,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2019-01-01 21:33:34,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:34,187 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-01-01 21:33:34,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2019-01-01 21:33:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-01-01 21:33:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 21:33:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-01-01 21:33:34,193 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-01-01 21:33:34,193 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-01-01 21:33:34,193 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 21:33:34,193 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2019-01-01 21:33:34,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:34,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:34,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:34,194 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1] [2019-01-01 21:33:34,194 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:34,195 INFO L794 eck$LassoCheckResult]: Stem: 1103#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1104#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1112#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1108#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1109#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1133#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1107#L20-3 main_~x~0 := main_~x~0 - 1; 1106#L19-2 main_~y~0 := main_~y~0 - 1; 1101#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1102#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1124#L19-2 main_~y~0 := main_~y~0 - 1; 1127#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1123#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1121#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1117#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1120#L20-3 main_~x~0 := main_~x~0 - 1; 1119#L19-2 main_~y~0 := main_~y~0 - 1; 1118#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1115#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2019-01-01 21:33:34,195 INFO L796 eck$LassoCheckResult]: Loop: 1105#L19-2 main_~y~0 := main_~y~0 - 1; 1099#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1100#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2019-01-01 21:33:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,195 INFO L82 PathProgramCache]: Analyzing trace with hash 715204654, now seen corresponding path program 3 times [2019-01-01 21:33:34,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:34,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:34,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:34,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:34,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:34,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,222 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 3 times [2019-01-01 21:33:34,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:34,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:34,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:34,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,230 INFO L82 PathProgramCache]: Analyzing trace with hash -670878974, now seen corresponding path program 4 times [2019-01-01 21:33:34,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:34,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:34,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:34,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 21:33:34,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:33:34,422 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:33:34,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-01 21:33:34,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-01 21:33:34,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:33:34,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,451 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 21:33:34,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:33:34,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 21:33:34,489 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:34,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:34,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:34,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:34,490 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:34,490 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:34,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:34,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:34,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:33:34,491 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:34,491 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:34,492 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:34,501 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:34,509 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:34,513 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:34,515 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:34,567 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:34,567 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:34,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:34,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:34,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:34,593 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:34,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:34,597 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:34,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:34,630 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:34,670 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:34,671 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:34,671 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:34,671 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:34,672 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:34,672 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:34,672 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:34,672 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:34,672 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:34,672 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration7_Loop [2019-01-01 21:33:34,672 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:34,672 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:34,673 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:34,679 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:34,682 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:34,702 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:34,704 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:34,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:34,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:34,754 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:34,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:34,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:34,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:34,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:34,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:34,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:34,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:34,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:34,759 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:34,759 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:34,760 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:34,760 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:34,760 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:34,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:33:34,760 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,843 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:34,844 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:34,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-01-01 21:33:34,874 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 7 states. [2019-01-01 21:33:34,877 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:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:33:34,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2019-01-01 21:33:34,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:34,878 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:34,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:34,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:34,939 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:34,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:33:34,940 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-01-01 21:33:35,021 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 74 states and 97 transitions. Complement of second has 9 states. [2019-01-01 21:33:35,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:33:35,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2019-01-01 21:33:35,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:35,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2019-01-01 21:33:35,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:35,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2019-01-01 21:33:35,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:35,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2019-01-01 21:33:35,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:35,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 89 transitions. [2019-01-01 21:33:35,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:35,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:35,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 89 transitions. [2019-01-01 21:33:35,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:35,030 INFO L705 BuchiCegarLoop]: Abstraction has 68 states and 89 transitions. [2019-01-01 21:33:35,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 89 transitions. [2019-01-01 21:33:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-01-01 21:33:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-01 21:33:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-01-01 21:33:35,035 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-01-01 21:33:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:33:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:33:35,036 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-01-01 21:33:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:35,083 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2019-01-01 21:33:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:33:35,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2019-01-01 21:33:35,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:35,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 107 states and 137 transitions. [2019-01-01 21:33:35,091 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:35,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:35,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 137 transitions. [2019-01-01 21:33:35,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:35,091 INFO L705 BuchiCegarLoop]: Abstraction has 107 states and 137 transitions. [2019-01-01 21:33:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 137 transitions. [2019-01-01 21:33:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2019-01-01 21:33:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-01 21:33:35,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2019-01-01 21:33:35,102 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-01-01 21:33:35,102 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-01-01 21:33:35,102 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 21:33:35,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. [2019-01-01 21:33:35,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:35,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:35,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:35,105 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1] [2019-01-01 21:33:35,105 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:35,105 INFO L794 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1706#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1719#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1715#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1716#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1754#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1753#L20-3 main_~x~0 := main_~x~0 - 1; 1752#L19-2 main_~y~0 := main_~y~0 - 1; 1750#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1751#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1742#L19-2 main_~y~0 := main_~y~0 - 1; 1741#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1738#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1735#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1732#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1734#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1724#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1727#L20-3 main_~x~0 := main_~x~0 - 1; 1726#L19-2 main_~y~0 := main_~y~0 - 1; 1725#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1722#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2019-01-01 21:33:35,106 INFO L796 eck$LassoCheckResult]: Loop: 1713#L19-2 main_~y~0 := main_~y~0 - 1; 1707#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1708#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2019-01-01 21:33:35,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1768639598, now seen corresponding path program 5 times [2019-01-01 21:33:35,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:35,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:35,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:35,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,134 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 4 times [2019-01-01 21:33:35,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:35,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:35,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1116494142, now seen corresponding path program 6 times [2019-01-01 21:33:35,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:35,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:35,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:35,193 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:35,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:35,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:35,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:35,194 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:35,194 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,194 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:35,194 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:35,194 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-01 21:33:35,194 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:35,195 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:35,196 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:35,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:35,211 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:35,216 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:35,218 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:35,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:35,274 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:35,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:35,301 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:35,302 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,307 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:35,307 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:35,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:35,373 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:35,375 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:35,375 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:35,375 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:35,375 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:35,375 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:35,375 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:35,375 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:35,375 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:35,375 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1_true-termination_true-no-overflow.c_Iteration8_Loop [2019-01-01 21:33:35,375 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:35,376 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:35,377 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:35,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:35,385 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:35,389 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:35,392 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:35,436 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:35,436 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:35,437 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:35,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:35,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:35,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:35,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:35,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:35,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:35,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:35,449 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:35,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:35,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:35,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:35,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:35,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:35,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:35,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:35,458 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:35,460 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:35,460 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:35,460 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:35,460 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:35,460 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:35,460 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-01-01 21:33:35,464 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:35,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:35,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:35,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,087 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:36,088 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:36,089 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-01-01 21:33:36,324 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 101 states and 134 transitions. Complement of second has 7 states. [2019-01-01 21:33:36,325 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:36,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:36,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-01-01 21:33:36,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:33:36,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,326 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:36,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:36,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:36,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,447 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:36,448 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:33:36,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-01-01 21:33:36,482 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 128 states and 166 transitions. Complement of second has 9 states. [2019-01-01 21:33:36,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-01-01 21:33:36,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:33:36,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,486 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:36,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:36,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:36,639 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:36,640 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 3 loop predicates [2019-01-01 21:33:36,640 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-01-01 21:33:36,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 139 states and 187 transitions. Complement of second has 8 states. [2019-01-01 21:33:36,696 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:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:36,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:33:36,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 21:33:36,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 24 letters. Loop has 3 letters. [2019-01-01 21:33:36,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 6 letters. [2019-01-01 21:33:36,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:36,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 187 transitions. [2019-01-01 21:33:36,703 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:36,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2019-01-01 21:33:36,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:36,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:36,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:36,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:36,704 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:36,704 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:36,704 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:36,704 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-01 21:33:36,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:36,704 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:36,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:36,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:36 BoogieIcfgContainer [2019-01-01 21:33:36,713 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:36,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:36,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:36,714 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:36,714 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:26" (3/4) ... [2019-01-01 21:33:36,718 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:36,718 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:36,719 INFO L168 Benchmark]: Toolchain (without parser) took 10532.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 944.6 MB in the beginning and 896.2 MB in the end (delta: 48.4 MB). Peak memory consumption was 257.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:36,720 INFO L168 Benchmark]: CDTParser took 0.26 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:36,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.00 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:36,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.99 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:36,722 INFO L168 Benchmark]: Boogie Preprocessor took 28.62 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:36,722 INFO L168 Benchmark]: RCFGBuilder took 357.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:36,723 INFO L168 Benchmark]: BuchiAutomizer took 9774.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 896.2 MB in the end (delta: 222.7 MB). Peak memory consumption was 297.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:36,724 INFO L168 Benchmark]: Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 896.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:36,728 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.26 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 315.00 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 933.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.99 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 28.62 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 357.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -185.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9774.16 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.0 MB). Free memory was 1.1 GB in the beginning and 896.2 MB in the end (delta: 222.7 MB). Peak memory consumption was 297.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 ms. Allocated memory is still 1.2 GB. Free memory is still 896.2 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 11 terminating modules (3 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 6.5s. Construction of modules took 0.5s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 155 SDslu, 81 SDs, 0 SdLazy, 157 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf99 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf94 smp100 dnf112 smp100 tf111 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...