./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Sunset.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/termination-restricted-15/Sunset.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-30f4e4a [2019-11-28 02:58:56,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 02:58:56,195 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 02:58:56,214 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 02:58:56,215 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 02:58:56,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 02:58:56,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 02:58:56,230 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 02:58:56,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 02:58:56,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 02:58:56,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 02:58:56,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 02:58:56,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 02:58:56,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 02:58:56,250 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 02:58:56,252 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 02:58:56,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 02:58:56,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 02:58:56,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 02:58:56,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 02:58:56,266 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 02:58:56,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 02:58:56,273 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 02:58:56,275 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 02:58:56,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 02:58:56,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 02:58:56,279 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 02:58:56,281 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 02:58:56,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 02:58:56,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 02:58:56,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 02:58:56,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 02:58:56,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 02:58:56,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 02:58:56,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 02:58:56,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 02:58:56,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 02:58:56,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 02:58:56,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 02:58:56,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 02:58:56,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 02:58:56,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 02:58:56,335 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 02:58:56,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 02:58:56,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 02:58:56,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 02:58:56,341 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 02:58:56,341 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 02:58:56,342 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 02:58:56,342 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 02:58:56,342 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 02:58:56,343 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 02:58:56,343 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 02:58:56,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 02:58:56,345 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 02:58:56,345 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 02:58:56,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 02:58:56,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 02:58:56,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 02:58:56,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 02:58:56,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 02:58:56,349 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 02:58:56,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 02:58:56,350 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 02:58:56,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 02:58:56,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 02:58:56,352 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 02:58:56,352 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 02:58:56,353 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 02:58:56,353 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 02:58:56,355 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 02:58:56,355 INFO L138 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 [2019-11-28 02:58:56,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 02:58:56,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 02:58:56,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 02:58:56,754 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 02:58:56,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 02:58:56,757 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Sunset.c [2019-11-28 02:58:56,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6896f61eb/eeb074df9e104023ae27d6287fc0b374/FLAG5563f8d39 [2019-11-28 02:58:57,256 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 02:58:57,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Sunset.c [2019-11-28 02:58:57,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6896f61eb/eeb074df9e104023ae27d6287fc0b374/FLAG5563f8d39 [2019-11-28 02:58:57,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6896f61eb/eeb074df9e104023ae27d6287fc0b374 [2019-11-28 02:58:57,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 02:58:57,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 02:58:57,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:57,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 02:58:57,641 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 02:58:57,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:57,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6af3dfac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57, skipping insertion in model container [2019-11-28 02:58:57,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:57,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 02:58:57,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 02:58:57,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:57,891 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 02:58:57,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 02:58:57,929 INFO L208 MainTranslator]: Completed translation [2019-11-28 02:58:57,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57 WrapperNode [2019-11-28 02:58:57,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 02:58:57,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:57,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 02:58:57,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 02:58:57,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:57,949 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:57,969 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 02:58:57,969 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 02:58:57,969 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 02:58:57,969 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 02:58:58,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... [2019-11-28 02:58:58,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 02:58:58,061 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 02:58:58,061 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 02:58:58,061 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 02:58:58,062 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:58,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 02:58:58,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 02:58:58,305 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 02:58:58,305 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 02:58:58,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:58 BoogieIcfgContainer [2019-11-28 02:58:58,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 02:58:58,308 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 02:58:58,308 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 02:58:58,311 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 02:58:58,312 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:58,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 02:58:57" (1/3) ... [2019-11-28 02:58:58,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c243136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:58, skipping insertion in model container [2019-11-28 02:58:58,313 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:58,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:58:57" (2/3) ... [2019-11-28 02:58:58,314 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c243136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 02:58:58, skipping insertion in model container [2019-11-28 02:58:58,314 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 02:58:58,314 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:58" (3/3) ... [2019-11-28 02:58:58,316 INFO L371 chiAutomizerObserver]: Analyzing ICFG Sunset.c [2019-11-28 02:58:58,364 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 02:58:58,364 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 02:58:58,364 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 02:58:58,364 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 02:58:58,365 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 02:58:58,365 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 02:58:58,365 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 02:58:58,365 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 02:58:58,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 02:58:58,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:58:58,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:58,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:58,405 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:58,406 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:58:58,406 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 02:58:58,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-11-28 02:58:58,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:58:58,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:58,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:58,408 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-11-28 02:58:58,408 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:58:58,414 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 [2019-11-28 02:58:58,415 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 [2019-11-28 02:58:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:58,422 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-11-28 02:58:58,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:58,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142112532] [2019-11-28 02:58:58,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:58,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:58,528 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 1 times [2019-11-28 02:58:58,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:58,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936242766] [2019-11-28 02:58:58,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:58,551 INFO L82 PathProgramCache]: Analyzing trace with hash 963344, now seen corresponding path program 1 times [2019-11-28 02:58:58,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:58,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425355498] [2019-11-28 02:58:58,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:58,565 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:58,698 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:58,699 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:58,700 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:58,700 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:58,700 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:58,701 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:58,701 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:58,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:58,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration1_Loop [2019-11-28 02:58:58,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:58,703 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:58,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:58,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:58,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:58,906 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:58,907 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:58,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:58,921 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:58,934 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:58,934 INFO L440 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) [2019-11-28 02:58:58,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:58,953 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:58,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:58,961 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:58,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:58,979 INFO L160 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 [2019-11-28 02:58:58,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:58,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:59,006 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:59,008 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:59,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:59,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:59,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:59,009 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:59,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,009 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:59,009 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:59,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration1_Loop [2019-11-28 02:58:59,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:59,010 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:59,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,092 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:59,097 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:59,108 INFO L120 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 Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:59,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:59,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:59,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:59,118 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:59,118 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:59,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:59,142 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:58:59,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:59,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:59,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:59,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:59,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:59,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:59,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:59,162 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:59,163 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2019-11-28 02:58:59,173 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:59,173 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:58:59,174 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:59,175 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2019-11-28 02:58:59,181 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,233 WARN L253 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,251 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:59,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:58:59,303 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-11-28 02:58:59,376 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. [2019-11-28 02:58:59,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:58:59,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-11-28 02:58:59,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-28 02:58:59,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:59,383 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:58:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,405 WARN L253 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,413 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:59,436 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 [2019-11-28 02:58:59,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2019-11-28 02:58:59,474 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. [2019-11-28 02:58:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:58:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:58:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-11-28 02:58:59,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 3 letters. [2019-11-28 02:58:59,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:59,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 02:58:59,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:59,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 1 letters. Loop has 6 letters. [2019-11-28 02:58:59,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:58:59,479 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2019-11-28 02:58:59,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:58:59,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 11 states and 17 transitions. [2019-11-28 02:58:59,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 02:58:59,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-11-28 02:58:59,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 17 transitions. [2019-11-28 02:58:59,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:58:59,493 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 17 transitions. [2019-11-28 02:58:59,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 17 transitions. [2019-11-28 02:58:59,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-11-28 02:58:59,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-28 02:58:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2019-11-28 02:58:59,528 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 02:58:59,528 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2019-11-28 02:58:59,528 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 02:58:59,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2019-11-28 02:58:59,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:58:59,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:58:59,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:58:59,532 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-28 02:58:59,532 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:58:59,533 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 [2019-11-28 02:58:59,533 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 [2019-11-28 02:58:59,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-11-28 02:58:59,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763890545] [2019-11-28 02:58:59,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,549 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 2 times [2019-11-28 02:58:59,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743618556] [2019-11-28 02:58:59,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 925833489, now seen corresponding path program 1 times [2019-11-28 02:58:59,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:58:59,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371009653] [2019-11-28 02:58:59,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:58:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:58:59,602 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:58:59,633 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:59,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:59,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:59,633 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:59,634 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:58:59,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:59,634 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:59,634 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration2_Loop [2019-11-28 02:58:59,634 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:59,634 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:59,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,696 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:59,697 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2019-11-28 02:58:59,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,702 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,707 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:59,708 INFO L440 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,723 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:58:59,728 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:58:59,728 INFO L440 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:59,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:58:59,740 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:59,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:58:59,763 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,770 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:58:59,773 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:58:59,773 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:58:59,774 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:58:59,774 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:58:59,774 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:58:59,774 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,774 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:58:59,774 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:58:59,775 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration2_Loop [2019-11-28 02:58:59,775 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:58:59,775 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:58:59,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:58:59,843 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:58:59,844 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 02:58:59,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:58:59,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:59,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:59,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:59,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:59,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:59,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:58:59,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:59,895 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:59,895 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:59,895 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:59,899 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:58:59,899 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:58:59,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:58:59,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:58:59,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:58:59,922 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:58:59,922 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:58:59,922 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:58:59,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:58:59,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:58:59,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,927 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:58:59,930 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:58:59,930 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. 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) [2019-11-28 02:58:59,936 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:58:59,937 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:58:59,937 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:58:59,937 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2019-11-28 02:58:59,940 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:58:59,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:58:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:58:59,974 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:58:59,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:58:59,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:58:59,984 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:58:59,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 15 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-11-28 02:59:00,008 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. [2019-11-28 02:59:00,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:00,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 02:59:00,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-28 02:59:00,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 02:59:00,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-28 02:59:00,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 34 transitions. [2019-11-28 02:59:00,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 02:59:00,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 33 transitions. [2019-11-28 02:59:00,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-11-28 02:59:00,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-28 02:59:00,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 33 transitions. [2019-11-28 02:59:00,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:00,015 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-11-28 02:59:00,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 33 transitions. [2019-11-28 02:59:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 02:59:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 02:59:00,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 30 transitions. [2019-11-28 02:59:00,018 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-11-28 02:59:00,018 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 30 transitions. [2019-11-28 02:59:00,019 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 02:59:00,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 30 transitions. [2019-11-28 02:59:00,020 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 02:59:00,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:00,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:00,020 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:00,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:59:00,021 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 [2019-11-28 02:59:00,021 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 [2019-11-28 02:59:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,021 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2019-11-28 02:59:00,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368449007] [2019-11-28 02:59:00,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368449007] [2019-11-28 02:59:00,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 02:59:00,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 02:59:00,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504056511] [2019-11-28 02:59:00,063 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 02:59:00,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash 39823, now seen corresponding path program 3 times [2019-11-28 02:59:00,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902442968] [2019-11-28 02:59:00,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,092 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:00,092 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:00,092 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:00,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:00,092 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:00,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,093 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:00,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:00,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration3_Loop [2019-11-28 02:59:00,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:00,093 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:00,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,161 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,161 INFO L404 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) [2019-11-28 02:59:00,178 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,178 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,184 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:00,185 INFO L440 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,194 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,206 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:00,206 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:00,216 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:00,220 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:00,220 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:00,220 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:00,220 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:00,221 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:00,221 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,221 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:00,221 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:00,221 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration3_Loop [2019-11-28 02:59:00,221 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:00,222 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:00,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,299 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,299 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 02:59:00,312 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:00,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:00,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,315 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:00,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:00,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:00,322 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:00,325 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:00,325 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,340 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:00,340 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:00,340 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:00,340 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 27 Supporting invariants [] [2019-11-28 02:59:00,342 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:00,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,379 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:59:00,396 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 02:59:00,423 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. [2019-11-28 02:59:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:00,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 02:59:00,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,425 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,460 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,477 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 [2019-11-28 02:59:00,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 30 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-28 02:59:00,511 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. [2019-11-28 02:59:00,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:00,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 02:59:00,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 02:59:00,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 02:59:00,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 02:59:00,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:59:00,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,515 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 70 transitions. [2019-11-28 02:59:00,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 02:59:00,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 42 states and 68 transitions. [2019-11-28 02:59:00,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2019-11-28 02:59:00,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 02:59:00,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 68 transitions. [2019-11-28 02:59:00,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:00,529 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 68 transitions. [2019-11-28 02:59:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 68 transitions. [2019-11-28 02:59:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-11-28 02:59:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 02:59:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2019-11-28 02:59:00,538 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 63 transitions. [2019-11-28 02:59:00,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:00,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 02:59:00,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 02:59:00,543 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 3 states. [2019-11-28 02:59:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:00,565 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2019-11-28 02:59:00,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 02:59:00,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 39 transitions. [2019-11-28 02:59:00,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-28 02:59:00,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2019-11-28 02:59:00,569 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 02:59:00,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 02:59:00,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2019-11-28 02:59:00,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:00,573 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-28 02:59:00,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2019-11-28 02:59:00,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2019-11-28 02:59:00,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-28 02:59:00,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-11-28 02:59:00,580 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:59:00,580 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-11-28 02:59:00,580 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 02:59:00,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-11-28 02:59:00,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 02:59:00,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:00,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:00,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-11-28 02:59:00,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:59:00,585 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 [2019-11-28 02:59:00,585 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 [2019-11-28 02:59:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 925833491, now seen corresponding path program 1 times [2019-11-28 02:59:00,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692560348] [2019-11-28 02:59:00,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,598 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,599 INFO L82 PathProgramCache]: Analyzing trace with hash 48373, now seen corresponding path program 4 times [2019-11-28 02:59:00,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543883937] [2019-11-28 02:59:00,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,607 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,608 INFO L82 PathProgramCache]: Analyzing trace with hash -774425949, now seen corresponding path program 2 times [2019-11-28 02:59:00,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:00,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028948066] [2019-11-28 02:59:00,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:00,621 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:00,666 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:00,666 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:00,666 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:00,666 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:00,667 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:00,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:00,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:00,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration4_Loop [2019-11-28 02:59:00,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:00,667 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:00,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,722 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,722 INFO L404 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) [2019-11-28 02:59:00,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:00,728 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:00,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:00,753 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,760 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:00,762 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:00,762 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:00,762 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:00,763 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:00,763 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:00,763 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,763 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:00,763 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:00,763 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration4_Loop [2019-11-28 02:59:00,764 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:00,764 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:00,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:00,837 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:00,837 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,863 INFO L120 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 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:59:00,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:00,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:00,872 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:00,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:00,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:59:00,881 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:00,881 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:00,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:00,888 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:00,888 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:00,894 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:00,894 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:00,894 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:00,894 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 28 Supporting invariants [] [2019-11-28 02:59:00,898 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:00,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,931 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:00,941 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:59:00,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:00,968 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. [2019-11-28 02:59:00,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:00,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:00,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 02:59:00,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:00,969 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:00,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:00,991 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:00,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,000 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 [2019-11-28 02:59:01,000 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:01,025 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. [2019-11-28 02:59:01,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:01,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:01,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 02:59:01,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,027 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:01,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,063 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,072 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 [2019-11-28 02:59:01,072 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:01,096 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. [2019-11-28 02:59:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:01,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:01,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2019-11-28 02:59:01,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-28 02:59:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-28 02:59:01,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-28 02:59:01,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 47 transitions. [2019-11-28 02:59:01,100 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:59:01,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 26 states and 37 transitions. [2019-11-28 02:59:01,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:59:01,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-28 02:59:01,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 37 transitions. [2019-11-28 02:59:01,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:01,101 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 37 transitions. [2019-11-28 02:59:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 37 transitions. [2019-11-28 02:59:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 13. [2019-11-28 02:59:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-28 02:59:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2019-11-28 02:59:01,104 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:59:01,104 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-11-28 02:59:01,104 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 02:59:01,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2019-11-28 02:59:01,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:59:01,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:01,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:59:01,105 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 [2019-11-28 02:59:01,105 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 [2019-11-28 02:59:01,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,106 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 2 times [2019-11-28 02:59:01,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135693050] [2019-11-28 02:59:01,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 1 times [2019-11-28 02:59:01,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383944463] [2019-11-28 02:59:01,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,121 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932832, now seen corresponding path program 3 times [2019-11-28 02:59:01,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490308524] [2019-11-28 02:59:01,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,131 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,152 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,152 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:01,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,152 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration5_Loop [2019-11-28 02:59:01,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,153 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,266 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,266 INFO L404 LassoAnalysis]: Checking for nontermination... 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 [2019-11-28 02:59:01,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,272 INFO L160 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 [2019-11-28 02:59:01,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:01,281 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:01,310 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:01,312 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,313 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:01,313 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,313 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration5_Loop [2019-11-28 02:59:01,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,313 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,406 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,406 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:01,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:01,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:01,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:01,418 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:01,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:01,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 02:59:01,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:01,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:01,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:01,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:01,433 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:01,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:01,439 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:01,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:01,449 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:01,452 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:59:01,452 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:01,456 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:01,456 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:01,456 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 02:59:01,458 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:01,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,479 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,491 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:59:01,491 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-11-28 02:59:01,510 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. [2019-11-28 02:59:01,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:01,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:01,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 3 letters. [2019-11-28 02:59:01,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 02:59:01,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:59:01,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-28 02:59:01,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:59:01,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 39 transitions. [2019-11-28 02:59:01,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-28 02:59:01,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 02:59:01,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 39 transitions. [2019-11-28 02:59:01,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:01,516 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-11-28 02:59:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 39 transitions. [2019-11-28 02:59:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 02:59:01,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 02:59:01,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-11-28 02:59:01,519 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-28 02:59:01,519 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 34 transitions. [2019-11-28 02:59:01,519 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 02:59:01,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 34 transitions. [2019-11-28 02:59:01,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-28 02:59:01,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:01,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:01,520 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2019-11-28 02:59:01,520 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 02:59:01,521 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 [2019-11-28 02:59:01,521 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 [2019-11-28 02:59:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1363932894, now seen corresponding path program 3 times [2019-11-28 02:59:01,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708149889] [2019-11-28 02:59:01,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,533 INFO L82 PathProgramCache]: Analyzing trace with hash 39885, now seen corresponding path program 2 times [2019-11-28 02:59:01,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805920675] [2019-11-28 02:59:01,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,539 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1760752396, now seen corresponding path program 4 times [2019-11-28 02:59:01,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:01,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043665552] [2019-11-28 02:59:01,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:01,553 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:01,587 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,588 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,588 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,588 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,588 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:01,588 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,588 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,588 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,588 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration6_Loop [2019-11-28 02:59:01,588 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,588 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,682 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,682 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:01,692 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:01,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:01,710 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,731 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:01,733 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:01,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:01,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:01,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:01,734 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:01,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:01,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:01,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration6_Loop [2019-11-28 02:59:01,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:01,734 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:01,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:01,827 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:01,828 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:01,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:01,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:01,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:01,835 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 02:59:01,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:01,836 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-28 02:59:01,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:01,841 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:01,844 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2019-11-28 02:59:01,844 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:01,848 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:01,848 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:01,849 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:01,849 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-11-28 02:59:01,851 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:01,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,876 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,887 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-28 02:59:01,887 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:01,902 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. [2019-11-28 02:59:01,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:01,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:01,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:01,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 02:59:01,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,904 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,927 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,942 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 [2019-11-28 02:59:01,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:01,960 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. [2019-11-28 02:59:01,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:01,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:01,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 02:59:01,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:01,961 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:01,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:01,984 WARN L253 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:01,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:01,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:01,994 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 [2019-11-28 02:59:01,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-28 02:59:02,010 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. [2019-11-28 02:59:02,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:02,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 02:59:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 02:59:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 3 letters. [2019-11-28 02:59:02,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 3 letters. [2019-11-28 02:59:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 6 letters. [2019-11-28 02:59:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 52 transitions. [2019-11-28 02:59:02,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:02,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 28 states and 38 transitions. [2019-11-28 02:59:02,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 02:59:02,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:59:02,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 38 transitions. [2019-11-28 02:59:02,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,016 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-28 02:59:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 38 transitions. [2019-11-28 02:59:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2019-11-28 02:59:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-28 02:59:02,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-11-28 02:59:02,019 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 02:59:02,019 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-11-28 02:59:02,020 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 02:59:02,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 26 transitions. [2019-11-28 02:59:02,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:59:02,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,021 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:02,021 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-28 02:59:02,021 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 [2019-11-28 02:59:02,021 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 [2019-11-28 02:59:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,022 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 4 times [2019-11-28 02:59:02,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582668609] [2019-11-28 02:59:02,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,028 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 1 times [2019-11-28 02:59:02,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574835978] [2019-11-28 02:59:02,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,037 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1762599376, now seen corresponding path program 5 times [2019-11-28 02:59:02,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202548305] [2019-11-28 02:59:02,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,049 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,088 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,088 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,088 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:02,089 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,089 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,089 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,089 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration7_Loop [2019-11-28 02:59:02,089 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,089 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,152 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,163 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,177 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:02,177 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,183 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:02,185 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,185 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:02,185 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,186 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,186 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,186 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration7_Loop [2019-11-28 02:59:02,186 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,186 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,235 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:02,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,251 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:02,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:02,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:02,262 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:02,262 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:02,262 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2019-11-28 02:59:02,265 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,320 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:02,320 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 02:59:02,345 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. [2019-11-28 02:59:02,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 02:59:02,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:59:02,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,347 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:02,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:02,395 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 26 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 02:59:02,453 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. [2019-11-28 02:59:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 02:59:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 6 letters. [2019-11-28 02:59:02,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-11-28 02:59:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:02,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,457 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2019-11-28 02:59:02,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:59:02,460 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 52 transitions. [2019-11-28 02:59:02,460 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 02:59:02,460 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:59:02,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 52 transitions. [2019-11-28 02:59:02,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:02,461 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 52 transitions. [2019-11-28 02:59:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 52 transitions. [2019-11-28 02:59:02,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-11-28 02:59:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 02:59:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-28 02:59:02,464 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 02:59:02,464 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-28 02:59:02,464 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 02:59:02,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-11-28 02:59:02,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 02:59:02,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:02,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:02,466 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 1, 1] [2019-11-28 02:59:02,466 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2019-11-28 02:59:02,466 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 [2019-11-28 02:59:02,466 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 [2019-11-28 02:59:02,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash -670293406, now seen corresponding path program 6 times [2019-11-28 02:59:02,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722344432] [2019-11-28 02:59:02,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,480 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1188224067, now seen corresponding path program 2 times [2019-11-28 02:59:02,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469662596] [2019-11-28 02:59:02,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:02,492 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:02,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2063994396, now seen corresponding path program 7 times [2019-11-28 02:59:02,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:02,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506867825] [2019-11-28 02:59:02,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,524 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:59:02,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506867825] [2019-11-28 02:59:02,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415098881] [2019-11-28 02:59:02,525 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 02:59:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 02:59:02,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 02:59:02,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-11-28 02:59:02,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426436533] [2019-11-28 02:59:02,578 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,578 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,579 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:02,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration8_Loop [2019-11-28 02:59:02,580 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,580 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,642 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,642 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,647 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:02,652 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:02,652 INFO L440 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 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:02,660 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:02,675 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,681 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:02,683 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:02,683 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:02,683 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:02,683 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:02,683 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:02,683 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,683 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:02,683 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:02,684 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration8_Loop [2019-11-28 02:59:02,684 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:02,684 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:02,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:02,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:02,725 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:02,732 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:02,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:02,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:02,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:02,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:02,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:02,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:02,747 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:02,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:02,749 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,751 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:02,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:02,753 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:02,758 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:02,758 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:02,758 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:02,758 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 55 Supporting invariants [] [2019-11-28 02:59:02,760 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:02,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:02,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:02,840 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. [2019-11-28 02:59:02,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:02,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-28 02:59:02,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 02:59:02,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,846 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:02,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:02,914 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:02,914 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:02,954 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. [2019-11-28 02:59:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 02:59:02,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 02:59:02,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:02,956 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:02,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:02,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:02,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,000 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 02:59:03,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:03,033 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. [2019-11-28 02:59:03,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:03,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-28 02:59:03,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 02:59:03,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,036 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,090 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 [2019-11-28 02:59:03,090 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 44 transitions. cyclomatic complexity: 17 Second operand 5 states. [2019-11-28 02:59:03,152 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. [2019-11-28 02:59:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 02:59:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2019-11-28 02:59:03,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 6 letters. [2019-11-28 02:59:03,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 19 letters. Loop has 6 letters. [2019-11-28 02:59:03,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 12 letters. [2019-11-28 02:59:03,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 101 transitions. [2019-11-28 02:59:03,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-11-28 02:59:03,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 49 states and 65 transitions. [2019-11-28 02:59:03,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-11-28 02:59:03,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-11-28 02:59:03,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 65 transitions. [2019-11-28 02:59:03,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,158 INFO L688 BuchiCegarLoop]: Abstraction has 49 states and 65 transitions. [2019-11-28 02:59:03,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 65 transitions. [2019-11-28 02:59:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 27. [2019-11-28 02:59:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:59:03,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-11-28 02:59:03,161 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-11-28 02:59:03,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 02:59:03,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 02:59:03,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 02:59:03,162 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 5 states. [2019-11-28 02:59:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 02:59:03,195 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2019-11-28 02:59:03,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 02:59:03,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 54 transitions. [2019-11-28 02:59:03,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 02:59:03,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 34 states and 42 transitions. [2019-11-28 02:59:03,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-11-28 02:59:03,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-11-28 02:59:03,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 42 transitions. [2019-11-28 02:59:03,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:03,199 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-28 02:59:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 42 transitions. [2019-11-28 02:59:03,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-11-28 02:59:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 02:59:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-28 02:59:03,202 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 02:59:03,202 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-28 02:59:03,202 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 02:59:03,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-28 02:59:03,203 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-11-28 02:59:03,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:03,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:03,204 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:03,204 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2019-11-28 02:59:03,204 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 [2019-11-28 02:59:03,204 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 [2019-11-28 02:59:03,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 5 times [2019-11-28 02:59:03,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817710932] [2019-11-28 02:59:03,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,212 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,212 INFO L82 PathProgramCache]: Analyzing trace with hash 73930127, now seen corresponding path program 3 times [2019-11-28 02:59:03,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830294389] [2019-11-28 02:59:03,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,223 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,223 INFO L82 PathProgramCache]: Analyzing trace with hash 139053282, now seen corresponding path program 8 times [2019-11-28 02:59:03,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:03,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511281236] [2019-11-28 02:59:03,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:03,236 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:03,274 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:03,274 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:03,274 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:03,275 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:03,275 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:03,275 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,275 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:03,275 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:03,275 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration9_Loop [2019-11-28 02:59:03,275 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:03,276 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:03,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,326 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:03,327 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,337 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-28 02:59:03,343 INFO L440 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:03,352 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:03,363 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,368 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:03,370 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:03,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:03,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:03,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:03,371 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:03,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:03,371 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:03,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration9_Loop [2019-11-28 02:59:03,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:03,372 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:03,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:03,419 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:03,419 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:03,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:03,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:03,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:03,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:03,435 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:03,435 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:03,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:03,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:03,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:03,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:03,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:03,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 02:59:03,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:03,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:03,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:03,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:03,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:03,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:03,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:03,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:03,465 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:03,468 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:03,468 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:03,472 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:03,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:03,473 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:03,473 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 26 Supporting invariants [] [2019-11-28 02:59:03,475 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-28 02:59:03,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 02:59:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,561 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 [2019-11-28 02:59:03,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 02:59:03,573 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. [2019-11-28 02:59:03,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:03,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 02:59:03,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,575 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,638 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 [2019-11-28 02:59:03,638 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 02:59:03,665 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. [2019-11-28 02:59:03,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 02:59:03,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 02:59:03,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,666 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,760 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 [2019-11-28 02:59:03,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 02:59:03,770 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. [2019-11-28 02:59:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:03,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 02:59:03,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 02:59:03,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,772 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,786 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,831 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 [2019-11-28 02:59:03,831 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 02:59:03,850 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. [2019-11-28 02:59:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 02:59:03,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 02:59:03,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:03,852 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:03,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:03,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 02:59:03,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:03,910 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 [2019-11-28 02:59:03,911 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 27 states and 34 transitions. cyclomatic complexity: 8 Second operand 6 states. [2019-11-28 02:59:04,003 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 [2019-11-28 02:59:04,004 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 [2019-11-28 02:59:04,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-11-28 02:59:04,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2019-11-28 02:59:04,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 9 letters. [2019-11-28 02:59:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 13 letters. Loop has 9 letters. [2019-11-28 02:59:04,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 4 letters. Loop has 18 letters. [2019-11-28 02:59:04,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 210 states and 292 transitions. [2019-11-28 02:59:04,012 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2019-11-28 02:59:04,013 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 210 states to 98 states and 131 transitions. [2019-11-28 02:59:04,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 02:59:04,013 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 02:59:04,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 98 states and 131 transitions. [2019-11-28 02:59:04,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,014 INFO L688 BuchiCegarLoop]: Abstraction has 98 states and 131 transitions. [2019-11-28 02:59:04,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states and 131 transitions. [2019-11-28 02:59:04,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 58. [2019-11-28 02:59:04,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 02:59:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 83 transitions. [2019-11-28 02:59:04,019 INFO L711 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2019-11-28 02:59:04,019 INFO L591 BuchiCegarLoop]: Abstraction has 58 states and 83 transitions. [2019-11-28 02:59:04,019 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 02:59:04,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 83 transitions. [2019-11-28 02:59:04,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-28 02:59:04,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:04,020 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:04,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:04,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2019-11-28 02:59:04,022 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 [2019-11-28 02:59:04,022 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 [2019-11-28 02:59:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 6 times [2019-11-28 02:59:04,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703543253] [2019-11-28 02:59:04,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,031 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -865799297, now seen corresponding path program 4 times [2019-11-28 02:59:04,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624206340] [2019-11-28 02:59:04,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2107106484, now seen corresponding path program 9 times [2019-11-28 02:59:04,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404064389] [2019-11-28 02:59:04,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,057 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,109 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:04,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:04,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:04,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:04,109 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 02:59:04,109 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,109 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:04,109 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:04,109 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration10_Loop [2019-11-28 02:59:04,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:04,110 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:04,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:04,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:04,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:04,157 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:04,157 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 02:59:04,165 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,175 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 02:59:04,175 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-28 02:59:04,181 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 02:59:04,182 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 02:59:04,183 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 02:59:04,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 02:59:04,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 02:59:04,183 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 02:59:04,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 02:59:04,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 02:59:04,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: Sunset.c_Iteration10_Loop [2019-11-28 02:59:04,184 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 02:59:04,184 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 02:59:04,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:04,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:04,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 02:59:04,237 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 02:59:04,237 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 02:59:04,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 02:59:04,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 02:59:04,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 02:59:04,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 02:59:04,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 02:59:04,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 02:59:04,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 02:59:04,249 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 02:59:04,255 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 02:59:04,255 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 02:59:04,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 02:59:04,261 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 02:59:04,261 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 02:59:04,261 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 51 Supporting invariants [] [2019-11-28 02:59:04,264 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 02:59:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,336 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 [2019-11-28 02:59:04,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 02:59:04,353 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. [2019-11-28 02:59:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:04,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-11-28 02:59:04,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:04,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,355 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:04,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,424 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 [2019-11-28 02:59:04,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 02:59:04,457 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. [2019-11-28 02:59:04,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:04,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2019-11-28 02:59:04,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:04,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,459 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,552 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 [2019-11-28 02:59:04,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 02:59:04,573 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. [2019-11-28 02:59:04,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-11-28 02:59:04,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:04,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,575 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:04,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,652 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 [2019-11-28 02:59:04,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 02:59:04,694 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. [2019-11-28 02:59:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 02:59:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-11-28 02:59:04,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:04,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,696 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 02:59:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 02:59:04,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 02:59:04,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 02:59:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 02:59:04,764 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 [2019-11-28 02:59:04,764 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 58 states and 83 transitions. cyclomatic complexity: 27 Second operand 7 states. [2019-11-28 02:59:04,922 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 [2019-11-28 02:59:04,923 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 [2019-11-28 02:59:04,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 02:59:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2019-11-28 02:59:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 12 letters. [2019-11-28 02:59:04,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 16 letters. Loop has 12 letters. [2019-11-28 02:59:04,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 45 transitions. Stem has 4 letters. Loop has 24 letters. [2019-11-28 02:59:04,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 02:59:04,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1452 transitions. [2019-11-28 02:59:04,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2019-11-28 02:59:04,940 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 212 states and 312 transitions. [2019-11-28 02:59:04,940 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-11-28 02:59:04,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-28 02:59:04,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 212 states and 312 transitions. [2019-11-28 02:59:04,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 02:59:04,941 INFO L688 BuchiCegarLoop]: Abstraction has 212 states and 312 transitions. [2019-11-28 02:59:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states and 312 transitions. [2019-11-28 02:59:04,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 126. [2019-11-28 02:59:04,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-28 02:59:04,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 200 transitions. [2019-11-28 02:59:04,950 INFO L711 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2019-11-28 02:59:04,950 INFO L591 BuchiCegarLoop]: Abstraction has 126 states and 200 transitions. [2019-11-28 02:59:04,951 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 02:59:04,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 126 states and 200 transitions. [2019-11-28 02:59:04,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2019-11-28 02:59:04,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 02:59:04,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 02:59:04,953 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-28 02:59:04,953 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 1] [2019-11-28 02:59:04,953 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 [2019-11-28 02:59:04,953 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 [2019-11-28 02:59:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash 963406, now seen corresponding path program 7 times [2019-11-28 02:59:04,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829440153] [2019-11-28 02:59:04,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,961 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1748234353, now seen corresponding path program 5 times [2019-11-28 02:59:04,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465745897] [2019-11-28 02:59:04,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 02:59:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1862223710, now seen corresponding path program 10 times [2019-11-28 02:59:04,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 02:59:04,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272025053] [2019-11-28 02:59:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 02:59:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 02:59:04,996 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 02:59:05,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 02:59:05 BoogieIcfgContainer [2019-11-28 02:59:05,122 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 02:59:05,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 02:59:05,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 02:59:05,124 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 02:59:05,124 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:58:58" (3/4) ... [2019-11-28 02:59:05,127 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-28 02:59:05,203 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 02:59:05,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 02:59:05,209 INFO L168 Benchmark]: Toolchain (without parser) took 7570.52 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.0 MB). Free memory was 960.4 MB in the beginning and 1.0 GB in the end (delta: -55.5 MB). Peak memory consumption was 214.6 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:05,210 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:59:05,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:05,211 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.03 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 02:59:05,211 INFO L168 Benchmark]: Boogie Preprocessor took 90.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:05,212 INFO L168 Benchmark]: RCFGBuilder took 246.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:05,213 INFO L168 Benchmark]: BuchiAutomizer took 6814.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.3 MB). Peak memory consumption was 216.1 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:05,213 INFO L168 Benchmark]: Witness Printer took 79.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 11.5 GB. [2019-11-28 02:59:05,227 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.52 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.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 38.03 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -136.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6814.84 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 179.8 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 36.3 MB). Peak memory consumption was 216.1 MB. Max. memory is 11.5 GB. * Witness Printer took 79.50 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. 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 6.7s and 11 iterations. TraceHistogramMax:5. Analysis of lassos took 3.7s. Construction of modules took 0.4s. Büchi inclusion checks took 2.3s. 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, 0.4s 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: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 7 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 10 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - 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@3ad41bfe=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...