./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e 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-restricted-15/Sunset_false-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 a80d10d797b477078e6dad6d87594a2a0aea1065 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:17:22,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:17:22,444 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:17:22,457 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:17:22,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:17:22,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:17:22,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:17:22,462 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:17:22,463 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:17:22,464 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:17:22,465 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:17:22,465 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:17:22,466 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:17:22,468 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:17:22,469 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:17:22,470 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:17:22,471 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:17:22,473 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:17:22,475 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:17:22,476 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:17:22,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:17:22,479 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:17:22,481 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:17:22,482 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:17:22,482 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:17:22,483 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:17:22,484 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:17:22,485 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:17:22,486 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:17:22,487 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:17:22,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:17:22,488 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:17:22,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:17:22,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:17:22,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:17:22,491 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:17:22,491 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:17:22,508 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:17:22,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:17:22,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:17:22,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:17:22,509 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:17:22,509 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:17:22,510 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:17:22,510 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:17:22,510 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:17:22,510 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:17:22,510 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:17:22,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:17:22,512 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:17:22,512 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:17:22,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:17:22,512 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:17:22,512 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:17:22,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:17:22,513 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:17:22,513 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:17:22,513 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:17:22,513 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:17:22,515 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:17:22,515 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:17:22,515 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:17:22,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:17:22,515 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:17:22,516 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:17:22,517 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:17:22,517 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 -> a80d10d797b477078e6dad6d87594a2a0aea1065 [2018-11-28 23:17:22,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:17:22,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:17:22,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:17:22,571 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:17:22,571 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:17:22,572 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c [2018-11-28 23:17:22,634 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9a39435/28e38353c3124d798cc4200b09f38105/FLAG18b6fc9df [2018-11-28 23:17:23,064 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:17:23,065 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/Sunset_false-termination_true-no-overflow.c [2018-11-28 23:17:23,072 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9a39435/28e38353c3124d798cc4200b09f38105/FLAG18b6fc9df [2018-11-28 23:17:23,463 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d9a39435/28e38353c3124d798cc4200b09f38105 [2018-11-28 23:17:23,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:17:23,468 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:17:23,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:23,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:17:23,473 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:17:23,474 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b855e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23, skipping insertion in model container [2018-11-28 23:17:23,477 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:17:23,502 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:17:23,728 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:23,734 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:17:23,756 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:17:23,774 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:17:23,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23 WrapperNode [2018-11-28 23:17:23,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:17:23,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:23,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:17:23,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:17:23,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:17:23,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:17:23,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:17:23,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:17:23,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,830 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,837 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (1/1) ... [2018-11-28 23:17:23,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:17:23,839 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:17:23,839 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:17:23,839 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:17:23,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (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 [2018-11-28 23:17:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:17:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:17:24,139 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:17:24,140 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:17:24,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:24 BoogieIcfgContainer [2018-11-28 23:17:24,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:17:24,141 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:17:24,141 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:17:24,146 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:17:24,147 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:24,147 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:17:23" (1/3) ... [2018-11-28 23:17:24,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58e318fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:24, skipping insertion in model container [2018-11-28 23:17:24,149 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:24,149 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:17:23" (2/3) ... [2018-11-28 23:17:24,149 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58e318fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:17:24, skipping insertion in model container [2018-11-28 23:17:24,150 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:17:24,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:24" (3/3) ... [2018-11-28 23:17:24,152 INFO L375 chiAutomizerObserver]: Analyzing ICFG Sunset_false-termination_true-no-overflow.c [2018-11-28 23:17:24,214 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:17:24,215 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:17:24,215 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:17:24,216 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:17:24,216 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:17:24,216 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:17:24,216 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:17:24,216 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:17:24,216 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:17:24,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 23:17:24,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:24,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:24,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:24,262 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:17:24,263 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:24,263 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:17:24,263 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2018-11-28 23:17:24,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:24,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:24,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:24,265 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:17:24,265 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:24,274 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 5#L13-1true [2018-11-28 23:17:24,274 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-1true assume !!(main_~i~0 > 10); 3#L10true assume 25 == main_~i~0;main_~i~0 := 30; 8#L10-2true assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 5#L13-1true [2018-11-28 23:17:24,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:24,281 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:17:24,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:24,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:24,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:24,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:24,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:24,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:24,393 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2018-11-28 23:17:24,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:24,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:24,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:24,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:24,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:24,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 963344, now seen corresponding path program 1 times [2018-11-28 23:17:24,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:24,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:24,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:24,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:24,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:24,632 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-11-28 23:17:24,683 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:24,684 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:24,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:24,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:24,685 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:24,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:24,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:24,686 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:24,686 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:17:24,686 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:24,686 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:24,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:24,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:24,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:24,873 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:24,873 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:24,881 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:24,881 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:24,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:24,908 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:24,913 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:24,914 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:24,935 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:24,935 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 [2018-11-28 23:17:24,941 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:24,942 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:17:24,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:24,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:25,006 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:25,023 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:25,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:25,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:25,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:25,024 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:25,024 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:25,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:25,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:25,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:17:25,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:25,026 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:25,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:25,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:25,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:25,274 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:17:25,346 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:25,350 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:25,352 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 [2018-11-28 23:17:25,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:25,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:25,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:25,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:25,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:25,360 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:25,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:25,372 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 [2018-11-28 23:17:25,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:25,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:25,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:25,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:25,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:25,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:25,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:25,385 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:25,392 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:25,392 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:25,395 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:25,395 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:25,395 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:25,396 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2018-11-28 23:17:25,397 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:25,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:25,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:25,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:25,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:25,588 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 [2018-11-28 23:17:25,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2018-11-28 23:17:25,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 27 states and 35 transitions. Complement of second has 6 states. [2018-11-28 23:17:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:25,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:17:25,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-28 23:17:25,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:25,853 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:25,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:26,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:26,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:26,051 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:17:26,051 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2018-11-28 23:17:26,149 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 8 states. [2018-11-28 23:17:26,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-11-28 23:17:26,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 3 letters. [2018-11-28 23:17:26,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:26,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:17:26,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:26,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 6 letters. [2018-11-28 23:17:26,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:26,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2018-11-28 23:17:26,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:26,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 17 transitions. [2018-11-28 23:17:26,165 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:17:26,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:17:26,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2018-11-28 23:17:26,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:26,167 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2018-11-28 23:17:26,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2018-11-28 23:17:26,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-28 23:17:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:17:26,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2018-11-28 23:17:26,195 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 23:17:26,195 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2018-11-28 23:17:26,195 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:17:26,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2018-11-28 23:17:26,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:26,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:26,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:26,197 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:17:26,197 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:26,198 INFO L794 eck$LassoCheckResult]: Stem: 126#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 127#L13-1 assume !!(main_~i~0 > 10); 130#L10 assume !(25 == main_~i~0); 123#L10-2 [2018-11-28 23:17:26,198 INFO L796 eck$LassoCheckResult]: Loop: 123#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 128#L13-1 assume !!(main_~i~0 > 10); 122#L10 assume 25 == main_~i~0;main_~i~0 := 30; 123#L10-2 [2018-11-28 23:17:26,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:26,198 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 23:17:26,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:26,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:26,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:26,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:26,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 2 times [2018-11-28 23:17:26,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:26,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:26,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:26,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:26,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash 925833489, now seen corresponding path program 1 times [2018-11-28 23:17:26,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:26,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:26,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:26,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:26,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:26,292 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:26,292 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:26,292 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:26,292 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:26,292 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:26,292 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:26,293 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:26,293 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:26,293 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:17:26,293 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:26,293 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:26,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:26,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:26,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:26,374 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:26,374 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:26,379 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:26,380 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:26,400 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:26,401 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:26,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:26,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:26,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:26,462 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:17:26,472 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:26,472 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:17:26,523 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:26,523 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:26,546 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:26,582 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:26,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:26,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:26,583 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:26,583 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:26,583 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:26,583 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:26,583 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:26,587 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:17:26,587 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:26,587 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:26,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:26,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:26,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:26,939 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:26,940 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:26,940 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 [2018-11-28 23:17:26,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:26,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:26,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:26,942 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:26,944 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:26,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:26,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:26,950 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 [2018-11-28 23:17:26,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:26,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:26,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:26,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:26,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:26,954 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:26,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:26,962 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 [2018-11-28 23:17:26,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:26,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:26,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:26,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:26,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:26,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:26,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:26,970 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:26,974 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:26,975 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:26,975 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:26,975 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:26,975 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:26,976 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2018-11-28 23:17:26,976 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:27,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:27,069 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 [2018-11-28 23:17:27,069 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-28 23:17:27,108 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 22 states and 34 transitions. Complement of second has 5 states. [2018-11-28 23:17:27,110 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 [2018-11-28 23:17:27,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 23:17:27,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-28 23:17:27,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:17:27,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-28 23:17:27,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2018-11-28 23:17:27,114 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:17:27,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 33 transitions. [2018-11-28 23:17:27,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:17:27,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:17:27,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2018-11-28 23:17:27,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:27,116 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2018-11-28 23:17:27,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2018-11-28 23:17:27,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-11-28 23:17:27,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:17:27,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2018-11-28 23:17:27,119 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2018-11-28 23:17:27,119 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2018-11-28 23:17:27,119 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:17:27,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2018-11-28 23:17:27,120 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:17:27,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:27,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:27,121 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:27,121 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:27,121 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 198#L13-1 assume !!(main_~i~0 > 10); 205#L10 assume 25 == main_~i~0;main_~i~0 := 30; 206#L10-2 assume !(main_~i~0 <= 30);main_~i~0 := 20; 199#L13-1 [2018-11-28 23:17:27,122 INFO L796 eck$LassoCheckResult]: Loop: 199#L13-1 assume !!(main_~i~0 > 10); 200#L10 assume 25 == main_~i~0;main_~i~0 := 30; 210#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 199#L13-1 [2018-11-28 23:17:27,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:27,122 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2018-11-28 23:17:27,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:27,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:27,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:27,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:27,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:17:27,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:17:27,167 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:17:27,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 3 times [2018-11-28 23:17:27,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:27,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:27,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:27,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:27,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:27,286 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:27,286 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:27,286 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:27,287 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:27,287 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:27,287 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:27,287 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:27,287 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:27,287 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:17:27,287 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:27,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:27,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:27,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:27,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:27,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:27,441 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:27,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:27,448 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:27,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:27,469 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:27,478 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:27,478 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:27,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:27,505 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:27,514 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:27,532 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:27,532 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:27,532 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:27,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:27,533 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:27,533 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:27,533 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:27,533 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:27,533 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:17:27,533 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:27,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:27,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:27,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:27,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:27,615 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:27,615 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:27,616 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 [2018-11-28 23:17:27,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:27,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:27,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:27,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:27,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:27,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:27,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:27,625 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:27,630 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:27,630 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:27,631 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:27,631 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:27,631 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:27,631 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2018-11-28 23:17:27,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:27,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:27,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:27,772 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 [2018-11-28 23:17:27,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-28 23:17:27,821 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 42 states and 66 transitions. Complement of second has 5 states. [2018-11-28 23:17:27,824 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 [2018-11-28 23:17:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:27,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:17:27,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,826 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:27,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:27,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:27,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:17:27,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2018-11-28 23:17:27,961 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 44 states and 70 transitions. Complement of second has 7 states. [2018-11-28 23:17:27,964 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 [2018-11-28 23:17:27,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:17:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:17:27,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:17:27,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:17:27,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:17:27,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:27,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. [2018-11-28 23:17:27,971 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:17:27,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 68 transitions. [2018-11-28 23:17:27,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-28 23:17:27,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 23:17:27,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2018-11-28 23:17:27,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:27,974 INFO L705 BuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2018-11-28 23:17:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2018-11-28 23:17:27,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-28 23:17:27,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:17:27,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2018-11-28 23:17:27,982 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 63 transitions. [2018-11-28 23:17:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 23:17:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 23:17:27,987 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2018-11-28 23:17:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:28,022 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-11-28 23:17:28,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 23:17:28,025 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2018-11-28 23:17:28,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:17:28,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-11-28 23:17:28,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-28 23:17:28,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:17:28,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-11-28 23:17:28,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:28,029 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-11-28 23:17:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-11-28 23:17:28,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2018-11-28 23:17:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:17:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 23:17:28,032 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:17:28,032 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:17:28,033 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:17:28,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 23:17:28,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:17:28,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:28,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:28,035 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2018-11-28 23:17:28,035 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:28,035 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 442#L13-1 assume !!(main_~i~0 > 10); 453#L10 assume !(25 == main_~i~0); 457#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 449#L13-1 assume !!(main_~i~0 > 10); 437#L10 assume !(25 == main_~i~0); 438#L10-2 [2018-11-28 23:17:28,037 INFO L796 eck$LassoCheckResult]: Loop: 438#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 443#L13-1 assume !!(main_~i~0 > 10); 444#L10 assume 25 == main_~i~0;main_~i~0 := 30; 438#L10-2 [2018-11-28 23:17:28,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash 925833491, now seen corresponding path program 1 times [2018-11-28 23:17:28,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,047 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 4 times [2018-11-28 23:17:28,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,057 INFO L82 PathProgramCache]: Analyzing trace with hash -774425949, now seen corresponding path program 2 times [2018-11-28 23:17:28,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:28,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,114 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:28,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:28,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:28,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:28,115 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:28,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,116 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:28,116 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:28,116 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:17:28,116 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:28,116 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:28,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,231 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:28,232 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,236 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:28,236 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 [2018-11-28 23:17:28,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:28,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:28,269 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:28,287 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:28,287 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:28,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:28,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:28,288 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:28,288 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,288 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:28,288 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:28,288 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:17:28,288 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:28,288 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:28,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,366 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:28,367 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:28,367 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 [2018-11-28 23:17:28,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:28,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:28,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:28,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:28,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:28,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:28,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:28,376 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:28,379 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:28,380 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:28,380 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:28,380 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:28,381 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:28,381 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2018-11-28 23:17:28,381 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:28,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:28,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:28,449 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 [2018-11-28 23:17:28,449 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:28,502 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2018-11-28 23:17:28,503 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 [2018-11-28 23:17:28,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:28,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:17:28,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:28,505 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:28,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:28,545 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:17:28,545 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:28,567 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 28 states and 41 transitions. Complement of second has 5 states. [2018-11-28 23:17:28,568 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 [2018-11-28 23:17:28,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:28,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:17:28,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:28,569 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:28,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:28,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:28,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:28,604 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:17:28,604 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:28,637 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 31 states and 47 transitions. Complement of second has 6 states. [2018-11-28 23:17:28,640 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 [2018-11-28 23:17:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2018-11-28 23:17:28,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:17:28,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:28,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:17:28,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:28,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 23:17:28,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:28,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 47 transitions. [2018-11-28 23:17:28,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:17:28,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 37 transitions. [2018-11-28 23:17:28,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:17:28,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:17:28,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2018-11-28 23:17:28,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:28,646 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-11-28 23:17:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2018-11-28 23:17:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2018-11-28 23:17:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:17:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2018-11-28 23:17:28,648 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:17:28,648 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:17:28,648 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:17:28,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2018-11-28 23:17:28,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:17:28,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:28,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:28,649 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:28,649 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:28,650 INFO L794 eck$LassoCheckResult]: Stem: 664#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 665#L13-1 assume !!(main_~i~0 > 10); 671#L10 assume !(25 == main_~i~0); 672#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 666#L13-1 [2018-11-28 23:17:28,650 INFO L796 eck$LassoCheckResult]: Loop: 666#L13-1 assume !!(main_~i~0 > 10); 660#L10 assume !(25 == main_~i~0); 661#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 666#L13-1 [2018-11-28 23:17:28,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,650 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2018-11-28 23:17:28,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:28,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2018-11-28 23:17:28,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:28,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932832, now seen corresponding path program 3 times [2018-11-28 23:17:28,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:28,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:28,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:28,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:28,707 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:28,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:28,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:28,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:28,707 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:28,707 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,707 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:28,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:28,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:17:28,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:28,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:28,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,839 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:28,839 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:28,848 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2018-11-28 23:17:28,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:28,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:28,907 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:28,910 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:28,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:28,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:28,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:28,910 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:28,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:28,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:28,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:28,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:17:28,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:28,911 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:28,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:28,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,070 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:29,070 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:29,072 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 [2018-11-28 23:17:29,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:29,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:29,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:29,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:29,082 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 [2018-11-28 23:17:29,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:29,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,083 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:29,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,087 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:29,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:29,095 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:29,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:29,100 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:17:29,100 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:29,100 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:29,100 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:29,100 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:17:29,101 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:29,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,154 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 [2018-11-28 23:17:29,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:17:29,178 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2018-11-28 23:17:29,179 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 [2018-11-28 23:17:29,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:29,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:17:29,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:17:29,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:17:29,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2018-11-28 23:17:29,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:17:29,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 39 transitions. [2018-11-28 23:17:29,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:17:29,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:17:29,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2018-11-28 23:17:29,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:29,183 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2018-11-28 23:17:29,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2018-11-28 23:17:29,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-28 23:17:29,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-28 23:17:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-11-28 23:17:29,185 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-28 23:17:29,185 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-11-28 23:17:29,185 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:17:29,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2018-11-28 23:17:29,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:17:29,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:29,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:29,187 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-28 23:17:29,187 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:17:29,187 INFO L794 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 754#L13-1 assume !!(main_~i~0 > 10); 768#L10 assume !(25 == main_~i~0); 769#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 756#L13-1 assume !!(main_~i~0 > 10); 757#L10 assume 25 == main_~i~0;main_~i~0 := 30; 760#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 761#L13-1 [2018-11-28 23:17:29,187 INFO L796 eck$LassoCheckResult]: Loop: 761#L13-1 assume !!(main_~i~0 > 10); 771#L10 assume !(25 == main_~i~0); 773#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 761#L13-1 [2018-11-28 23:17:29,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932894, now seen corresponding path program 3 times [2018-11-28 23:17:29,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,197 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 2 times [2018-11-28 23:17:29,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:29,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1760752396, now seen corresponding path program 4 times [2018-11-28 23:17:29,202 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:29,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,258 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:29,259 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:29,259 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:29,259 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:29,259 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:29,259 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,259 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:29,259 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:29,260 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:17:29,260 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:29,260 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:29,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,411 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:29,412 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:17:29,420 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:29,420 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,456 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:29,456 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:29,486 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:29,488 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:29,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:29,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:29,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:29,488 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:29,488 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:29,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:29,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:17:29,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:29,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:29,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:29,580 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:29,580 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:29,580 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 [2018-11-28 23:17:29,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:29,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:29,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:29,589 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:17:29,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:29,590 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:17:29,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:29,607 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:29,612 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:29,615 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:17:29,615 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:29,615 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:29,615 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:29,616 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:17:29,616 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:29,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,690 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 [2018-11-28 23:17:29,690 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:29,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2018-11-28 23:17:29,711 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 [2018-11-28 23:17:29,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:29,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:17:29,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,712 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:29,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,747 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:17:29,747 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:29,757 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 5 states. [2018-11-28 23:17:29,758 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 [2018-11-28 23:17:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:29,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:17:29,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,760 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:29,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:29,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:29,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:29,809 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:17:29,810 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2018-11-28 23:17:29,840 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 52 transitions. Complement of second has 4 states. [2018-11-28 23:17:29,842 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 [2018-11-28 23:17:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:17:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 23:17:29,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:17:29,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:17:29,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:17:29,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:29,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 52 transitions. [2018-11-28 23:17:29,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:17:29,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 38 transitions. [2018-11-28 23:17:29,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:17:29,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:17:29,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2018-11-28 23:17:29,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:29,848 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2018-11-28 23:17:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2018-11-28 23:17:29,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-11-28 23:17:29,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:17:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2018-11-28 23:17:29,850 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-28 23:17:29,850 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2018-11-28 23:17:29,850 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:17:29,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2018-11-28 23:17:29,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:17:29,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:29,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:29,851 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:29,851 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-28 23:17:29,852 INFO L794 eck$LassoCheckResult]: Stem: 1006#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1007#L13-1 assume !!(main_~i~0 > 10); 1012#L10 assume !(25 == main_~i~0); 1013#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1008#L13-1 [2018-11-28 23:17:29,852 INFO L796 eck$LassoCheckResult]: Loop: 1008#L13-1 assume !!(main_~i~0 > 10); 1005#L10 assume !(25 == main_~i~0); 1004#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1011#L13-1 assume !!(main_~i~0 > 10); 1015#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1014#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1008#L13-1 [2018-11-28 23:17:29,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 4 times [2018-11-28 23:17:29,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:29,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 1 times [2018-11-28 23:17:29,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:29,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:29,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1762599376, now seen corresponding path program 5 times [2018-11-28 23:17:29,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:29,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:29,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:29,978 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:29,979 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:29,979 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:29,979 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:29,979 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:29,980 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:29,980 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:29,980 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:29,980 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:17:29,980 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:29,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:29,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,065 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:30,065 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:30,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:30,071 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:30,095 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:30,095 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:30,102 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:30,121 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:30,122 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:30,122 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:30,122 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:30,122 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:30,122 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:30,122 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:30,122 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:30,122 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:17:30,122 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:30,122 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:30,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:30,213 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:30,213 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:30,214 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 [2018-11-28 23:17:30,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:30,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:30,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:30,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:30,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:30,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:30,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:30,220 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:30,223 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:30,223 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:30,224 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:30,224 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:30,224 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:30,224 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2018-11-28 23:17:30,224 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:30,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:30,339 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 [2018-11-28 23:17:30,339 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:17:30,420 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 7 states. [2018-11-28 23:17:30,421 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 [2018-11-28 23:17:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:17:30,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:17:30,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:30,424 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:30,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:30,556 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:30,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-28 23:17:30,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 48 states and 64 transitions. Complement of second has 9 states. [2018-11-28 23:17:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:30,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 23:17:30,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:17:30,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:30,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:17:30,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:30,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:17:30,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:30,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2018-11-28 23:17:30,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:17:30,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 52 transitions. [2018-11-28 23:17:30,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:17:30,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:17:30,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2018-11-28 23:17:30,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:30,712 INFO L705 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2018-11-28 23:17:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2018-11-28 23:17:30,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-11-28 23:17:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-28 23:17:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-11-28 23:17:30,715 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-28 23:17:30,715 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-11-28 23:17:30,715 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:17:30,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-11-28 23:17:30,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:17:30,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:30,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:30,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2018-11-28 23:17:30,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-28 23:17:30,717 INFO L794 eck$LassoCheckResult]: Stem: 1226#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1227#L13-1 assume !!(main_~i~0 > 10); 1234#L10 assume !(25 == main_~i~0); 1235#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1228#L13-1 assume !!(main_~i~0 > 10); 1230#L10 assume !(25 == main_~i~0); 1251#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1247#L13-1 assume !!(main_~i~0 > 10); 1248#L10 assume !(25 == main_~i~0); 1246#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1238#L13-1 assume !!(main_~i~0 > 10); 1245#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1236#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1237#L13-1 [2018-11-28 23:17:30,717 INFO L796 eck$LassoCheckResult]: Loop: 1237#L13-1 assume !!(main_~i~0 > 10); 1248#L10 assume !(25 == main_~i~0); 1246#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1238#L13-1 assume !!(main_~i~0 > 10); 1245#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1236#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1237#L13-1 [2018-11-28 23:17:30,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:30,718 INFO L82 PathProgramCache]: Analyzing trace with hash -670293406, now seen corresponding path program 6 times [2018-11-28 23:17:30,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:30,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:30,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:30,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:30,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 2 times [2018-11-28 23:17:30,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:30,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:30,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:30,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:30,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2063994396, now seen corresponding path program 7 times [2018-11-28 23:17:30,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:30,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:30,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:30,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:30,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 23:17:30,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:17:30,782 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:17:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:30,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 23:17:30,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:17:30,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-28 23:17:31,007 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2018-11-28 23:17:31,024 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:31,024 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:31,024 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:31,024 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:31,024 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:31,024 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:31,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:31,025 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:17:31,025 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:31,025 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:31,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,126 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:31,126 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:31,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:31,151 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:31,151 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:17:31,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:31,155 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:31,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:31,195 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:31,212 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:31,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:31,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:31,213 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:31,213 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:31,213 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:31,213 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:31,213 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:31,213 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:17:31,213 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:31,213 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:31,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:31,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:31,276 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:31,276 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 [2018-11-28 23:17:31,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:31,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:31,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:31,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:31,283 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:31,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:31,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:31,291 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 [2018-11-28 23:17:31,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:31,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:31,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:31,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:31,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:31,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:31,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:31,299 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:31,302 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:31,302 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:31,302 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:31,302 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:31,303 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:31,304 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2018-11-28 23:17:31,305 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:31,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:31,431 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 [2018-11-28 23:17:31,431 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-28 23:17:31,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 81 states and 107 transitions. Complement of second has 7 states. [2018-11-28 23:17:31,499 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 [2018-11-28 23:17:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2018-11-28 23:17:31,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 23:17:31,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,500 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:31,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:31,610 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:31,610 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-28 23:17:31,680 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 55 states and 74 transitions. Complement of second has 9 states. [2018-11-28 23:17:31,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 23:17:31,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 23:17:31,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,682 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:31,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:31,729 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:31,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-28 23:17:31,758 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 101 states and 141 transitions. Complement of second has 10 states. [2018-11-28 23:17:31,760 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 [2018-11-28 23:17:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:17:31,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 23:17:31,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,762 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:31,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:31,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:31,819 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:17:31,819 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2018-11-28 23:17:31,894 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 76 states and 101 transitions. Complement of second has 11 states. [2018-11-28 23:17:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:17:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 23:17:31,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 23:17:31,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2018-11-28 23:17:31,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2018-11-28 23:17:31,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:31,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2018-11-28 23:17:31,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 23:17:31,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 65 transitions. [2018-11-28 23:17:31,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:17:31,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:17:31,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2018-11-28 23:17:31,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:31,900 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2018-11-28 23:17:31,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2018-11-28 23:17:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2018-11-28 23:17:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:17:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2018-11-28 23:17:31,903 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2018-11-28 23:17:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:17:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:17:31,904 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2018-11-28 23:17:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:17:31,942 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-28 23:17:31,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:17:31,943 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2018-11-28 23:17:31,945 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 23:17:31,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 42 transitions. [2018-11-28 23:17:31,946 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-28 23:17:31,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 23:17:31,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2018-11-28 23:17:31,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:31,946 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2018-11-28 23:17:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2018-11-28 23:17:31,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2018-11-28 23:17:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:17:31,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2018-11-28 23:17:31,949 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-28 23:17:31,949 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-28 23:17:31,949 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:17:31,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2018-11-28 23:17:31,950 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:17:31,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:31,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:31,951 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:31,951 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-28 23:17:31,951 INFO L794 eck$LassoCheckResult]: Stem: 1992#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 1993#L13-1 assume !!(main_~i~0 > 10); 2008#L10 assume !(25 == main_~i~0); 2010#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 [2018-11-28 23:17:31,951 INFO L796 eck$LassoCheckResult]: Loop: 1994#L13-1 assume !!(main_~i~0 > 10); 1988#L10 assume 25 == main_~i~0;main_~i~0 := 30; 1989#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1996#L13-1 assume !!(main_~i~0 > 10); 1990#L10 assume !(25 == main_~i~0); 1991#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1997#L13-1 assume !!(main_~i~0 > 10); 2014#L10 assume !(25 == main_~i~0); 2013#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 1994#L13-1 [2018-11-28 23:17:31,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 5 times [2018-11-28 23:17:31,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:31,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 73930127, now seen corresponding path program 3 times [2018-11-28 23:17:31,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:31,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 139053282, now seen corresponding path program 8 times [2018-11-28 23:17:31,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:31,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:31,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:32,040 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:32,041 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:32,041 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:32,041 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:32,041 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:32,041 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,041 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:32,041 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:32,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration9_Loop [2018-11-28 23:17:32,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:32,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:32,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:32,309 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:32,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:32,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:17:32,334 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:32,338 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:32,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:32,364 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:32,381 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:32,381 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:32,381 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:32,381 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:32,382 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:32,382 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:32,382 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:32,382 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:32,382 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration9_Loop [2018-11-28 23:17:32,382 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:32,382 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:32,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:32,468 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:32,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:32,469 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 [2018-11-28 23:17:32,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:32,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:32,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:32,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:32,474 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:32,474 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:32,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:32,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:17:32,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:32,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:32,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:32,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:32,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:17:32,488 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:17:32,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:17:32,494 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 [2018-11-28 23:17:32,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:32,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:32,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:32,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:32,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:32,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:32,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:32,501 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:32,508 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:32,508 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:32,511 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:32,511 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:32,511 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:32,511 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2018-11-28 23:17:32,512 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:32,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,590 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:17:32,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 23:17:32,610 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 47 transitions. Complement of second has 5 states. [2018-11-28 23:17:32,611 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 [2018-11-28 23:17:32,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:17:32,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:32,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-28 23:17:32,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:32,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,715 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:17:32,716 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 23:17:32,742 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 40 states and 49 transitions. Complement of second has 7 states. [2018-11-28 23:17:32,742 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 [2018-11-28 23:17:32,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:17:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:17:32,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-28 23:17:32,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,743 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:32,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,818 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 4 loop predicates [2018-11-28 23:17:32,818 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 23:17:32,829 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 39 states and 49 transitions. Complement of second has 5 states. [2018-11-28 23:17:32,829 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 [2018-11-28 23:17:32,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:17:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 23:17:32,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-28 23:17:32,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,830 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:32,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:32,906 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:17:32,906 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 23:17:32,927 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 41 states and 51 transitions. Complement of second has 6 states. [2018-11-28 23:17:32,927 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 [2018-11-28 23:17:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:17:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:17:32,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-28 23:17:32,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:32,929 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:32,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:32,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:33,141 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:17:33,142 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2018-11-28 23:17:33,260 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. Result 210 states and 292 transitions. Complement of second has 48 states 9 powerset states39 rank states. The highest rank that occured is 5 [2018-11-28 23:17:33,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:17:33,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-28 23:17:33,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-28 23:17:33,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:33,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-28 23:17:33,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:33,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-28 23:17:33,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:33,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. [2018-11-28 23:17:33,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-28 23:17:33,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 98 states and 131 transitions. [2018-11-28 23:17:33,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:17:33,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:17:33,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2018-11-28 23:17:33,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:33,277 INFO L705 BuchiCegarLoop]: Abstraction has 98 states and 131 transitions. [2018-11-28 23:17:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2018-11-28 23:17:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2018-11-28 23:17:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-28 23:17:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2018-11-28 23:17:33,285 INFO L728 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2018-11-28 23:17:33,285 INFO L608 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2018-11-28 23:17:33,285 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:17:33,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2018-11-28 23:17:33,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-28 23:17:33,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:33,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:33,289 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:33,289 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-28 23:17:33,290 INFO L794 eck$LassoCheckResult]: Stem: 2689#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 2691#L13-1 assume !!(main_~i~0 > 10); 2705#L10 assume !(25 == main_~i~0); 2701#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2692#L13-1 [2018-11-28 23:17:33,290 INFO L796 eck$LassoCheckResult]: Loop: 2692#L13-1 assume !!(main_~i~0 > 10); 2693#L10 assume 25 == main_~i~0;main_~i~0 := 30; 2741#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2739#L13-1 assume !!(main_~i~0 > 10); 2734#L10 assume !(25 == main_~i~0); 2732#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2727#L13-1 assume !!(main_~i~0 > 10); 2714#L10 assume !(25 == main_~i~0); 2726#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2725#L13-1 assume !!(main_~i~0 > 10); 2698#L10 assume !(25 == main_~i~0); 2696#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 2692#L13-1 [2018-11-28 23:17:33,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,290 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 6 times [2018-11-28 23:17:33,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:33,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:33,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,297 INFO L82 PathProgramCache]: Analyzing trace with hash -865799297, now seen corresponding path program 4 times [2018-11-28 23:17:33,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:33,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -2107106484, now seen corresponding path program 9 times [2018-11-28 23:17:33,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:33,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:33,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:33,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:33,434 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-11-28 23:17:33,440 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:33,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:33,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:33,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:33,440 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:17:33,440 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:33,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:33,441 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration10_Loop [2018-11-28 23:17:33,441 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:33,441 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:33,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,507 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:33,507 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:17:33,514 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,538 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:17:33,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:17:33,542 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:17:33,559 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:17:33,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:17:33,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:17:33,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:17:33,560 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:17:33,560 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:17:33,560 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:17:33,560 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:17:33,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: Sunset_false-termination_true-no-overflow.c_Iteration10_Loop [2018-11-28 23:17:33,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:17:33,560 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:17:33,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:17:33,637 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:17:33,638 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:17:33,638 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 [2018-11-28 23:17:33,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:17:33,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:17:33,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:17:33,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:17:33,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:17:33,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:17:33,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:17:33,643 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:17:33,645 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:17:33,645 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:17:33,645 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:17:33,645 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:17:33,646 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:17:33,646 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2018-11-28 23:17:33,646 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:17:33,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:33,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:17:33,798 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-28 23:17:33,828 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 101 states and 129 transitions. Complement of second has 5 states. [2018-11-28 23:17:33,831 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 [2018-11-28 23:17:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:17:33,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:17:33,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:33,832 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:33,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:33,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,019 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:17:34,019 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-28 23:17:34,048 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 106 states and 135 transitions. Complement of second has 7 states. [2018-11-28 23:17:34,050 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 [2018-11-28 23:17:34,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:34,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2018-11-28 23:17:34,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:17:34,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,052 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:34,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,180 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 5 loop predicates [2018-11-28 23:17:34,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-28 23:17:34,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 95 states and 126 transitions. Complement of second has 5 states. [2018-11-28 23:17:34,214 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 [2018-11-28 23:17:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2018-11-28 23:17:34,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:17:34,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,215 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:34,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,301 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:17:34,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-28 23:17:34,347 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27. Second operand 7 states. Result 99 states and 128 transitions. Complement of second has 6 states. [2018-11-28 23:17:34,348 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 [2018-11-28 23:17:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:17:34,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:17:34,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,350 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:17:34,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:17:34,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:17:34,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:17:34,548 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:17:34,548 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2018-11-28 23:17:34,816 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. Result 1058 states and 1452 transitions. Complement of second has 131 states 20 powerset states111 rank states. The highest rank that occured is 5 [2018-11-28 23:17:34,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-28 23:17:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:17:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2018-11-28 23:17:34,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 12 letters. [2018-11-28 23:17:34,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 16 letters. Loop has 12 letters. [2018-11-28 23:17:34,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2018-11-28 23:17:34,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:17:34,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1452 transitions. [2018-11-28 23:17:34,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2018-11-28 23:17:34,840 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 212 states and 312 transitions. [2018-11-28 23:17:34,840 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:17:34,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:17:34,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 312 transitions. [2018-11-28 23:17:34,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:17:34,843 INFO L705 BuchiCegarLoop]: Abstraction has 212 states and 312 transitions. [2018-11-28 23:17:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 312 transitions. [2018-11-28 23:17:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2018-11-28 23:17:34,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-28 23:17:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2018-11-28 23:17:34,861 INFO L728 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2018-11-28 23:17:34,861 INFO L608 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2018-11-28 23:17:34,861 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:17:34,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 200 transitions. [2018-11-28 23:17:34,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2018-11-28 23:17:34,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:17:34,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:17:34,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:17:34,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2018-11-28 23:17:34,869 INFO L794 eck$LassoCheckResult]: Stem: 4641#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~i~0;havoc main_~i~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0; 4645#L13-1 assume !!(main_~i~0 > 10); 4657#L10 assume !(25 == main_~i~0); 4655#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4646#L13-1 [2018-11-28 23:17:34,869 INFO L796 eck$LassoCheckResult]: Loop: 4646#L13-1 assume !!(main_~i~0 > 10); 4647#L10 assume 25 == main_~i~0;main_~i~0 := 30; 4761#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4759#L13-1 assume !!(main_~i~0 > 10); 4757#L10 assume !(25 == main_~i~0); 4755#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4751#L13-1 assume !!(main_~i~0 > 10); 4748#L10 assume !(25 == main_~i~0); 4746#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4741#L13-1 assume !!(main_~i~0 > 10); 4660#L10 assume !(25 == main_~i~0); 4689#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4687#L13-1 assume !!(main_~i~0 > 10); 4652#L10 assume !(25 == main_~i~0); 4650#L10-2 assume main_~i~0 <= 30;main_~i~0 := main_~i~0 - 1; 4646#L13-1 [2018-11-28 23:17:34,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,869 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 7 times [2018-11-28 23:17:34,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:34,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1748234353, now seen corresponding path program 5 times [2018-11-28 23:17:34,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:17:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:34,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:17:34,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1862223710, now seen corresponding path program 10 times [2018-11-28 23:17:34,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:17:34,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:17:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:17:34,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:17:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:17:35,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:17:35 BoogieIcfgContainer [2018-11-28 23:17:35,055 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:17:35,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:17:35,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:17:35,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:17:35,056 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:17:24" (3/4) ... [2018-11-28 23:17:35,060 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-28 23:17:35,110 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 23:17:35,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:17:35,112 INFO L168 Benchmark]: Toolchain (without parser) took 11644.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 240.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -165.4 MB). Peak memory consumption was 75.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:35,113 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:17:35,113 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.83 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. [2018-11-28 23:17:35,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.54 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. [2018-11-28 23:17:35,114 INFO L168 Benchmark]: Boogie Preprocessor took 19.56 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. [2018-11-28 23:17:35,115 INFO L168 Benchmark]: RCFGBuilder took 301.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -102.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:35,115 INFO L168 Benchmark]: BuchiAutomizer took 10914.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -82.3 MB). Peak memory consumption was 90.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:17:35,116 INFO L168 Benchmark]: Witness Printer took 54.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:17:35,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.83 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 43.54 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 19.56 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 301.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 67.6 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -102.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10914.08 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 173.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -82.3 MB). Peak memory consumption was 90.7 MB. Max. memory is 11.5 GB. * Witness Printer took 54.99 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 12 terminating modules (2 trivial, 5 deterministic, 5 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + 27 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One deterministic module has affine ranking function -1 * i + 27 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 28 and consists of 3 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 55 and consists of 5 locations. One nondeterministic module has affine ranking function -1 * i + 26 and consists of 6 locations. One nondeterministic module has affine ranking function -2 * i + 51 and consists of 8 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 126 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 5.7s. Construction of modules took 1.0s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 5. Minimization of det autom 0. Minimization of nondet autom 12. Automata minimization 0.0s AutomataMinimizationTime, 12 MinimizatonAttempts, 200 StatesRemovedByMinimization, 12 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 126 states and ocurred in iteration 10. Nontrivial modules had stage [2, 3, 2, 1, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/33 HoareTripleCheckerStatistics: 173 SDtfs, 246 SDslu, 6 SDs, 0 SdLazy, 346 SolverSat, 88 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT8 conc0 concLT1 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital9 mio100 ax234 hnf100 lsp43 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq191 hnf89 smp100 dnf113 smp97 tf112 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@70fb212f=0, \result=0, i=25} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 Loop: [L9] COND TRUE i > 10 [L10] COND TRUE i == 25 [L11] i = 30 [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 [L9] COND TRUE i > 10 [L10] COND FALSE !(i == 25) [L13] COND TRUE i <= 30 [L14] i = i-1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...