./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_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-wcet2_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 4f5dfa3dfde4da491a923b915452cddcc4ed5c87 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:41,025 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:41,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:41,040 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:41,040 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:41,041 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:41,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:41,045 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:41,047 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:41,047 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:41,049 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:41,049 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:41,050 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:41,051 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:41,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:41,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:41,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:41,056 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:41,058 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:41,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:41,062 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:41,063 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:41,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:41,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:41,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:41,068 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:41,069 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:41,070 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:41,071 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:41,072 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:41,072 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:41,073 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:41,073 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:41,073 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:41,074 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:41,075 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:41,076 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:41,094 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:41,094 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:41,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:41,096 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:41,096 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:41,096 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:41,096 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:41,097 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:41,097 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:41,097 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:41,097 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:41,097 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:41,098 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:41,098 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:41,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:41,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:41,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:41,099 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:41,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:41,099 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:41,099 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:41,100 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:41,100 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:41,100 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:41,100 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:41,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:41,101 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:41,101 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:41,102 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:41,102 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 -> 4f5dfa3dfde4da491a923b915452cddcc4ed5c87 [2019-01-01 21:33:41,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:41,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:41,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:41,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:41,194 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:41,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c [2019-01-01 21:33:41,255 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fe5645a/c0643f55476f4ca9a7170ad5a3e1b136/FLAGad8f689e9 [2019-01-01 21:33:41,695 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:41,696 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c [2019-01-01 21:33:41,706 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fe5645a/c0643f55476f4ca9a7170ad5a3e1b136/FLAGad8f689e9 [2019-01-01 21:33:42,072 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9fe5645a/c0643f55476f4ca9a7170ad5a3e1b136 [2019-01-01 21:33:42,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:42,077 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:42,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:42,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:42,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:42,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:42" (1/1) ... [2019-01-01 21:33:42,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3087b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:42, skipping insertion in model container [2019-01-01 21:33:42,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:42" (1/1) ... [2019-01-01 21:33:42,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:42,121 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:42,370 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:42,376 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:42,400 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:42,418 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:42,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:42 WrapperNode [2019-01-01 21:33:42,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:42,420 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:42,420 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:42,420 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:42,431 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:42" (1/1) ... [2019-01-01 21:33:42,438 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:42" (1/1) ... [2019-01-01 21:33:42,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:42,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:42,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:42,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:42,477 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:42" (1/1) ... [2019-01-01 21:33:42,478 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:42" (1/1) ... [2019-01-01 21:33:42,478 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:42" (1/1) ... [2019-01-01 21:33:42,478 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:42" (1/1) ... [2019-01-01 21:33:42,480 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:42" (1/1) ... [2019-01-01 21:33:42,485 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:42" (1/1) ... [2019-01-01 21:33:42,485 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:42" (1/1) ... [2019-01-01 21:33:42,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:42,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:42,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:42,487 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:42,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:42" (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:42,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:42,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:42,829 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:42,829 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 21:33:42,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:42 BoogieIcfgContainer [2019-01-01 21:33:42,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:42,831 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:42,831 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:42,835 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:42,835 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:42,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:42" (1/3) ... [2019-01-01 21:33:42,837 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@473ff804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:42, skipping insertion in model container [2019-01-01 21:33:42,837 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:42,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:42" (2/3) ... [2019-01-01 21:33:42,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@473ff804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:42, skipping insertion in model container [2019-01-01 21:33:42,838 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:42,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:42" (3/3) ... [2019-01-01 21:33:42,840 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c [2019-01-01 21:33:42,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:42,907 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:42,907 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:42,907 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:42,907 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:42,907 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:42,907 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:42,907 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:42,907 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:42,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:42,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:42,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:42,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:42,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:42,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:42,964 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:42,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:42,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:33:42,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:42,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:42,966 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-01 21:33:42,966 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:33:42,975 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 3#L17-2true [2019-01-01 21:33:42,976 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !!(main_~i~0 < 5);main_~j~0 := 0; 6#L19-2true assume !(main_~i~0 > 2 && main_~j~0 <= 9); 5#L19-3true main_~i~0 := 1 + main_~i~0; 3#L17-2true [2019-01-01 21:33:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:42,984 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-01 21:33:42,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:42,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,088 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-01 21:33:43,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,108 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2019-01-01 21:33:43,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,342 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-01-01 21:33:43,378 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:43,379 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:43,379 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:43,379 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:43,380 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:43,380 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:43,380 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:43,380 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:43,380 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:43,380 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:43,381 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:43,407 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:43,440 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:43,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:43,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:43,663 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:43,664 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:43,677 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:43,677 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:43,714 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:43,715 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:43,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:43,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:43,742 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:43,743 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:43,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:43,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:43,754 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:43,754 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0} Honda state: {ULTIMATE.start_main_~j~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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:43,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:43,776 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:43,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:43,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:43,858 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:43,863 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:43,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:43,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:43,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:43,864 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:43,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:43,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:43,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:43,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:43,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:43,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:43,870 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:43,915 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:44,005 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:44,029 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:44,163 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:44,170 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:44,172 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:44,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:44,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:44,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:44,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:44,180 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:44,180 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:44,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:44,189 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:44,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:44,190 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:44,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:44,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:44,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:44,192 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:44,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:44,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:44,206 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:44,207 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:44,209 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:44,210 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:44,210 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:44,211 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2019-01-01 21:33:44,212 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:44,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:44,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:44,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:44,735 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:44,752 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:44,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-01-01 21:33:44,977 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 30 states and 48 transitions. Complement of second has 9 states. [2019-01-01 21:33:44,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:44,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2019-01-01 21:33:44,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. [2019-01-01 21:33:44,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:44,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-01 21:33:44,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:44,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. [2019-01-01 21:33:44,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:44,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 48 transitions. [2019-01-01 21:33:44,989 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:44,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2019-01-01 21:33:44,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:44,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-01 21:33:44,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2019-01-01 21:33:44,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:44,997 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2019-01-01 21:33:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2019-01-01 21:33:45,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 21:33:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:45,025 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:45,025 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:45,025 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:45,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2019-01-01 21:33:45,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:45,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:45,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:45,027 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:45,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:33:45,027 INFO L794 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 87#L17-2 assume !!(main_~i~0 < 5);main_~j~0 := 0; 83#L19-2 [2019-01-01 21:33:45,028 INFO L796 eck$LassoCheckResult]: Loop: 83#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 90#L19-2 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 88#L19-3 main_~i~0 := 1 + main_~i~0; 82#L17-2 assume !!(main_~i~0 < 5);main_~j~0 := 0; 83#L19-2 [2019-01-01 21:33:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-01 21:33:45,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1506610, now seen corresponding path program 1 times [2019-01-01 21:33:45,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,049 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 1 times [2019-01-01 21:33:45,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:45,174 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:33:45,174 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:33:45,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:45,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:33:45,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-01 21:33:45,397 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-01-01 21:33:45,415 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:45,415 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:45,415 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:45,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:45,416 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:45,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,416 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:45,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:45,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:45,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:45,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:45,419 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:45,427 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:45,471 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:45,507 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:45,920 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-01 21:33:46,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,045 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:46,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,051 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,073 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:46,073 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:46,078 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,078 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:46,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:46,104 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,131 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:46,134 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:46,134 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:46,134 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:46,134 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:46,134 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:46,134 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:46,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:46,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:46,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:46,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:46,138 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:46,184 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:46,190 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:46,194 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:46,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,354 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:46,354 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:46,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:46,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:46,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:46,363 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:46,367 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:46,368 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:46,368 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:46,368 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:46,369 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:46,369 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 7 Supporting invariants [] [2019-01-01 21:33:46,369 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:46,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 21:33:46,510 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:46,510 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-01 21:33:46,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 22 states and 31 transitions. Complement of second has 6 states. [2019-01-01 21:33:46,587 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:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:33:46,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:46,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:33:46,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:33:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2019-01-01 21:33:46,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:46,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 15 states and 22 transitions. [2019-01-01 21:33:46,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-01 21:33:46,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:46,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2019-01-01 21:33:46,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:46,593 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-01 21:33:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2019-01-01 21:33:46,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-01-01 21:33:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-01 21:33:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2019-01-01 21:33:46,596 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2019-01-01 21:33:46,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 21:33:46,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 21:33:46,601 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 4 states. [2019-01-01 21:33:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:46,641 INFO L93 Difference]: Finished difference Result 17 states and 24 transitions. [2019-01-01 21:33:46,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:33:46,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. [2019-01-01 21:33:46,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:46,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 24 transitions. [2019-01-01 21:33:46,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:46,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:46,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 24 transitions. [2019-01-01 21:33:46,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:46,646 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2019-01-01 21:33:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 24 transitions. [2019-01-01 21:33:46,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-01 21:33:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-01 21:33:46,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-01-01 21:33:46,649 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-01 21:33:46,649 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-01 21:33:46,649 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:46,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-01-01 21:33:46,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:46,650 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:46,650 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:46,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:33:46,651 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:46,651 INFO L794 eck$LassoCheckResult]: Stem: 210#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 205#L17-2 assume !!(main_~i~0 < 5);main_~j~0 := 0; 207#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 211#L19-2 [2019-01-01 21:33:46,651 INFO L796 eck$LassoCheckResult]: Loop: 211#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 211#L19-2 [2019-01-01 21:33:46,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,651 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-01 21:33:46,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:46,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:46,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:46,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-01 21:33:46,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:46,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:46,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:46,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,685 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2019-01-01 21:33:46,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:46,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:46,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:46,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,737 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:46,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:46,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:46,737 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:46,737 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:46,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:46,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:46,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:46,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:46,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:46,740 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:46,746 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:46,756 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:46,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,867 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,868 INFO L412 LassoAnalysis]: Checking for nontermination... 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:46,879 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,879 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:46,907 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:46,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:46,937 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0=3} Honda state: {ULTIMATE.start_main_~i~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:46,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,943 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:46,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:46,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:47,009 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:47,011 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:47,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:47,012 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:47,012 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:47,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:47,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:47,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:47,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:47,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:47,013 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:47,013 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:47,014 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:47,020 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:47,029 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:47,036 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:47,127 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:47,127 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:47,128 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:47,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:47,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:47,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:47,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:47,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:47,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:47,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:47,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:47,133 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:47,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:47,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:47,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:47,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:47,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:47,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:47,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:47,139 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:47,142 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:47,142 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:47,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:47,143 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:47,143 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:47,143 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2019-01-01 21:33:47,144 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:47,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,185 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:47,186 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:47,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 10 Second operand 2 states. [2019-01-01 21:33:47,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 34 states and 46 transitions. Complement of second has 5 states. [2019-01-01 21:33:47,206 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:47,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:33:47,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-01 21:33:47,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-01 21:33:47,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:33:47,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 46 transitions. [2019-01-01 21:33:47,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:47,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 28 states and 39 transitions. [2019-01-01 21:33:47,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:47,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:47,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 39 transitions. [2019-01-01 21:33:47,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:47,213 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 39 transitions. [2019-01-01 21:33:47,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 39 transitions. [2019-01-01 21:33:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2019-01-01 21:33:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-01 21:33:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-01-01 21:33:47,222 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:33:47,222 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-01-01 21:33:47,222 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:47,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2019-01-01 21:33:47,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-01 21:33:47,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:47,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:47,228 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2019-01-01 21:33:47,228 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-01 21:33:47,228 INFO L794 eck$LassoCheckResult]: Stem: 294#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0;havoc main_~i~0;havoc main_~j~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1; 287#L17-2 assume !!(main_~i~0 < 5);main_~j~0 := 0; 289#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 295#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 296#L19-2 assume !(main_~i~0 > 2 && main_~j~0 <= 9); 292#L19-3 main_~i~0 := 1 + main_~i~0; 293#L17-2 assume !!(main_~i~0 < 5);main_~j~0 := 0; 297#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 298#L19-2 [2019-01-01 21:33:47,228 INFO L796 eck$LassoCheckResult]: Loop: 298#L19-2 assume !!(main_~i~0 > 2 && main_~j~0 <= 9);main_~j~0 := 1 + main_~j~0; 298#L19-2 [2019-01-01 21:33:47,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,229 INFO L82 PathProgramCache]: Analyzing trace with hash 782487737, now seen corresponding path program 2 times [2019-01-01 21:33:47,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:47,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:47,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:47,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:47,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:33:47,308 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:33:47,319 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 21:33:47,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 21:33:47,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 21:33:47,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:47,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 21:33:47,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 21:33:47,366 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:47,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,367 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-01 21:33:47,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:47,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:47,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:47,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:47,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:47,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:47,418 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:47,418 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:47,418 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:47,418 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:47,418 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:47,418 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:47,418 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:47,419 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:47,419 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:47,419 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:47,419 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:47,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:47,430 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:47,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:47,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:47,489 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:47,489 INFO L412 LassoAnalysis]: Checking for nontermination... 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:47,495 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:47,495 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:47,536 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:47,536 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:47,558 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:47,560 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:47,560 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:47,560 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:47,560 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:47,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:47,561 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:47,561 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:47,561 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:47,561 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wcet2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:47,561 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:47,561 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:47,562 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:47,572 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:47,575 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:47,581 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:47,661 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:47,661 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:47,662 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:47,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:47,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:47,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:47,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:47,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:47,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:47,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:47,672 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:47,676 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:47,677 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 21:33:47,677 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:47,677 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:47,678 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:47,678 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 19 Supporting invariants [] [2019-01-01 21:33:47,678 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,731 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:47,732 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:47,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-01 21:33:47,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 32 states and 43 transitions. Complement of second has 5 states. [2019-01-01 21:33:47,754 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:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:47,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:33:47,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-01 21:33:47,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,755 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:47,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,799 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:47,799 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:47,800 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-01 21:33:47,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 32 states and 43 transitions. Complement of second has 5 states. [2019-01-01 21:33:47,840 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:47,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:47,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:33:47,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-01 21:33:47,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,842 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,898 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:47,899 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:47,899 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-01 21:33:47,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 29 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 25 states and 34 transitions. Complement of second has 4 states. [2019-01-01 21:33:47,937 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:47,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-01 21:33:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-01 21:33:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 1 letters. [2019-01-01 21:33:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 1 letters. [2019-01-01 21:33:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:47,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 34 transitions. [2019-01-01 21:33:47,941 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:47,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2019-01-01 21:33:47,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:47,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:47,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:47,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:47,944 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,944 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:33:47,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:33:47,945 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 21:33:47,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:47,946 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 21:33:47,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 21:33:47,946 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 21:33:47,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:47,946 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 21:33:47,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:47,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:47,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:47,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:47,947 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,947 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,947 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,947 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:47,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:47,948 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:47,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:47,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:47 BoogieIcfgContainer [2019-01-01 21:33:47,956 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:47,956 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:47,956 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:47,957 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:47,957 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:42" (3/4) ... [2019-01-01 21:33:47,962 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:47,962 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:47,963 INFO L168 Benchmark]: Toolchain (without parser) took 5886.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 951.4 MB in the beginning and 811.3 MB in the end (delta: 140.0 MB). Peak memory consumption was 271.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,964 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.01 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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:47,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.88 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,966 INFO L168 Benchmark]: Boogie Preprocessor took 20.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,967 INFO L168 Benchmark]: RCFGBuilder took 343.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,968 INFO L168 Benchmark]: BuchiAutomizer took 5124.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 811.3 MB in the end (delta: 294.7 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,969 INFO L168 Benchmark]: Witness Printer took 5.81 ms. Allocated memory is still 1.2 GB. Free memory is still 811.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,973 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.01 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.88 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.19 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 343.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5124.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 811.3 MB in the end (delta: 294.7 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.81 ms. Allocated memory is still 1.2 GB. Free memory is still 811.3 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 5 and consists of 6 locations. One deterministic module has affine ranking function -2 * i + 7 and consists of 4 locations. One deterministic module has affine ranking function -2 * j + 19 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 19 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 3.5s. Construction of modules took 0.2s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 20 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 38 SDtfs, 38 SDslu, 13 SDs, 0 SdLazy, 59 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax181 hnf99 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp94 dnf100 smp100 tf113 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...