./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-crafted-lit/Urban-WST2013-Fig2.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 9c55a9a6f50b70c8ad02d8f9cdba1133727e3a9a73c5b8d3940178ed4735e2c1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:12,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:12,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:12,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:12,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:12,451 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:12,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:12,454 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:12,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:12,460 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:12,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:12,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:12,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:12,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:12,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:12,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:12,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:12,470 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:12,471 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:12,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:12,473 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:12,474 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:12,475 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:12,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:12,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:12,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:12,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:12,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:12,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:12,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:12,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:12,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:12,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:12,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:12,484 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:12,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:12,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:12,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:12,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:12,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:12,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:12,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:25:12,511 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:12,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:12,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:12,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:12,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:12,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:12,514 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:12,514 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:12,514 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:12,514 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:12,514 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:12,515 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:12,515 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:12,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:12,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:12,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:12,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:12,516 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:12,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:12,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:12,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:12,517 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:12,517 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:12,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:12,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:12,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:12,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:12,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:12,519 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:12,519 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 9c55a9a6f50b70c8ad02d8f9cdba1133727e3a9a73c5b8d3940178ed4735e2c1 [2022-02-21 03:25:12,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:12,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:12,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:12,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:12,770 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:12,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2022-02-21 03:25:12,827 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbefd747/59bf841965d54f01abf340077936304a/FLAG62ab53e4a [2022-02-21 03:25:13,160 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:13,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/Urban-WST2013-Fig2.c [2022-02-21 03:25:13,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbefd747/59bf841965d54f01abf340077936304a/FLAG62ab53e4a [2022-02-21 03:25:13,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cbefd747/59bf841965d54f01abf340077936304a [2022-02-21 03:25:13,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:13,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:13,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:13,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:13,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:13,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dd2d72d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13, skipping insertion in model container [2022-02-21 03:25:13,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:13,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:13,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:13,381 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:13,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:13,410 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:13,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13 WrapperNode [2022-02-21 03:25:13,411 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:13,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:13,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:13,413 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:13,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,436 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-21 03:25:13,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:13,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:13,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:13,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:13,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,456 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:13,457 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:13,457 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:13,457 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:13,458 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (1/1) ... [2022-02-21 03:25:13,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:13,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:25:13,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:13,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:13,577 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:13,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:13,629 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:13,635 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:13,635 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:25:13,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:13 BoogieIcfgContainer [2022-02-21 03:25:13,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:13,638 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:13,638 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:13,641 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:13,642 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:13,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:13" (1/3) ... [2022-02-21 03:25:13,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@694bedb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:13, skipping insertion in model container [2022-02-21 03:25:13,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:13,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:13" (2/3) ... [2022-02-21 03:25:13,643 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@694bedb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:13, skipping insertion in model container [2022-02-21 03:25:13,643 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:13,643 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:13" (3/3) ... [2022-02-21 03:25:13,644 INFO L388 chiAutomizerObserver]: Analyzing ICFG Urban-WST2013-Fig2.c [2022-02-21 03:25:13,708 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:13,718 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:13,718 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:13,719 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:13,719 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:13,719 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:13,719 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:13,719 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:13,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:13,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:13,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:13,777 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:13,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:13,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,785 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:13,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:13,792 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 3#L19-2true [2022-02-21 03:25:13,792 INFO L793 eck$LassoCheckResult]: Loop: 3#L19-2true assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 7#L21-2true assume !(main_~x2~0#1 > 1); 5#L21-3true main_~x1~0#1 := 1 + main_~x1~0#1; 3#L19-2true [2022-02-21 03:25:13,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,797 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:25:13,804 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:13,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689628494] [2022-02-21 03:25:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,887 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:13,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,890 INFO L85 PathProgramCache]: Analyzing trace with hash 40944, now seen corresponding path program 1 times [2022-02-21 03:25:13,891 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:13,891 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951086030] [2022-02-21 03:25:13,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:13,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:13,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {17#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:13,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {16#false} is VALID [2022-02-21 03:25:13,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#false} main_~x1~0#1 := 1 + main_~x1~0#1; {16#false} is VALID [2022-02-21 03:25:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:13,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:13,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951086030] [2022-02-21 03:25:13,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951086030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:25:13,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:25:13,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:25:13,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008882957] [2022-02-21 03:25:13,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:25:13,984 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:13,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:25:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:25:14,007 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,034 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:25:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:25:14,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:14,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2022-02-21 03:25:14,059 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:14,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 6 states and 7 transitions. [2022-02-21 03:25:14,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:25:14,063 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:25:14,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2022-02-21 03:25:14,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:14,064 INFO L681 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-02-21 03:25:14,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2022-02-21 03:25:14,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2022-02-21 03:25:14,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:14,088 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,088 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,089 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,090 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2022-02-21 03:25:14,090 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2022-02-21 03:25:14,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 6 states and 7 transitions. [2022-02-21 03:25:14,091 INFO L87 Difference]: Start difference. First operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 6 states and 7 transitions. [2022-02-21 03:25:14,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,092 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2022-02-21 03:25:14,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2022-02-21 03:25:14,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:14,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:14,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-02-21 03:25:14,095 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-02-21 03:25:14,095 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2022-02-21 03:25:14,095 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:14,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2022-02-21 03:25:14,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:14,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:14,096 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:25:14,096 INFO L791 eck$LassoCheckResult]: Stem: 31#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 28#L19-2 [2022-02-21 03:25:14,097 INFO L793 eck$LassoCheckResult]: Loop: 28#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 29#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 33#L21-2 assume !(main_~x2~0#1 > 1); 30#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 28#L19-2 [2022-02-21 03:25:14,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,097 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:25:14,098 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,098 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202722431] [2022-02-21 03:25:14,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,104 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1271024, now seen corresponding path program 1 times [2022-02-21 03:25:14,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173048402] [2022-02-21 03:25:14,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {53#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {54#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {52#false} is VALID [2022-02-21 03:25:14,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#false} main_~x1~0#1 := 1 + main_~x1~0#1; {52#false} is VALID [2022-02-21 03:25:14,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:14,164 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:14,164 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173048402] [2022-02-21 03:25:14,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173048402] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:14,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969963772] [2022-02-21 03:25:14,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:14,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:14,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:25:14,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:25:14,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {53#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {54#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {54#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {52#false} is VALID [2022-02-21 03:25:14,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#false} main_~x1~0#1 := 1 + main_~x1~0#1; {52#false} is VALID [2022-02-21 03:25:14,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:14,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:14,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {52#false} main_~x1~0#1 := 1 + main_~x1~0#1; {52#false} is VALID [2022-02-21 03:25:14,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(< 1 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {52#false} is VALID [2022-02-21 03:25:14,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {74#(< 2 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {70#(< 1 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,355 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {74#(< 2 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:14,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969963772] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:14,356 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:14,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-02-21 03:25:14,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674215861] [2022-02-21 03:25:14,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:14,358 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:14,358 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:14,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:25:14,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:25:14,362 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,403 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:25:14,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:25:14,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:14,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2022-02-21 03:25:14,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:25:14,421 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:25:14,421 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:25:14,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:25:14,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-02-21 03:25:14,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:14,422 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:25:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-02-21 03:25:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:25:14,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:14,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,423 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,424 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,425 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:25:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:25:14,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 10 transitions. [2022-02-21 03:25:14,427 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 10 transitions. [2022-02-21 03:25:14,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,427 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:25:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:25:14,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:14,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:14,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:25:14,429 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:25:14,429 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:25:14,429 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:14,429 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:25:14,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:25:14,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:14,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2022-02-21 03:25:14,430 INFO L791 eck$LassoCheckResult]: Stem: 87#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 88#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 84#L19-2 [2022-02-21 03:25:14,430 INFO L793 eck$LassoCheckResult]: Loop: 84#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 85#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 89#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 92#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 91#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 90#L21-2 assume !(main_~x2~0#1 > 1); 86#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 84#L19-2 [2022-02-21 03:25:14,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,431 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-02-21 03:25:14,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706624921] [2022-02-21 03:25:14,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,436 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,436 INFO L85 PathProgramCache]: Analyzing trace with hash -787882000, now seen corresponding path program 2 times [2022-02-21 03:25:14,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000509043] [2022-02-21 03:25:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {118#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {119#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {120#(<= 8 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {120#(<= 8 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {121#(<= 7 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(<= 7 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {122#(<= 6 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#(<= 6 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {117#false} is VALID [2022-02-21 03:25:14,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} main_~x1~0#1 := 1 + main_~x1~0#1; {117#false} is VALID [2022-02-21 03:25:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:14,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:14,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000509043] [2022-02-21 03:25:14,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000509043] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:14,520 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446117408] [2022-02-21 03:25:14,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:25:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,524 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:14,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:25:14,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:25:14,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:25:14,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:25:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {118#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(<= 10 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {119#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#(<= 9 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {120#(<= 8 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {120#(<= 8 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {121#(<= 7 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(<= 7 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {122#(<= 6 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {122#(<= 6 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {117#false} is VALID [2022-02-21 03:25:14,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} main_~x1~0#1 := 1 + main_~x1~0#1; {117#false} is VALID [2022-02-21 03:25:14,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:14,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:14,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {117#false} main_~x1~0#1 := 1 + main_~x1~0#1; {117#false} is VALID [2022-02-21 03:25:14,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#(< 1 |ULTIMATE.start_main_~x2~0#1|)} assume !(main_~x2~0#1 > 1); {117#false} is VALID [2022-02-21 03:25:14,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(< 2 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {147#(< 1 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#(< 3 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {151#(< 2 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#(< 4 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {155#(< 3 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {122#(<= 6 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {159#(< 4 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#true} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {122#(<= 6 |ULTIMATE.start_main_~x2~0#1|)} is VALID [2022-02-21 03:25:14,862 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:14,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446117408] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:14,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:14,864 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-02-21 03:25:14,864 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492091608] [2022-02-21 03:25:14,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:14,866 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:25:14,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:14,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:25:14,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:25:14,868 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,904 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:25:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:25:14,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:14,917 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 15 transitions. [2022-02-21 03:25:14,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:25:14,919 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 15 transitions. [2022-02-21 03:25:14,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:25:14,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:25:14,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2022-02-21 03:25:14,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:14,919 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:25:14,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2022-02-21 03:25:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-21 03:25:14,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:14,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,921 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,922 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,923 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:25:14,923 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:25:14,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 15 transitions. [2022-02-21 03:25:14,924 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 15 transitions. [2022-02-21 03:25:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:14,925 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-21 03:25:14,925 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:25:14,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:14,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-21 03:25:14,927 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:25:14,927 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-21 03:25:14,927 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:14,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:25:14,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:25:14,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,928 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:14,929 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2022-02-21 03:25:14,929 INFO L791 eck$LassoCheckResult]: Stem: 180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 181#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 177#L19-2 [2022-02-21 03:25:14,929 INFO L793 eck$LassoCheckResult]: Loop: 177#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 178#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 182#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 190#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 189#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 188#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 187#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 186#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 185#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 184#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 183#L21-2 assume !(main_~x2~0#1 > 1); 179#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 177#L19-2 [2022-02-21 03:25:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-02-21 03:25:14,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163144725] [2022-02-21 03:25:14,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,933 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,935 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,936 INFO L85 PathProgramCache]: Analyzing trace with hash -219093776, now seen corresponding path program 3 times [2022-02-21 03:25:14,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291961677] [2022-02-21 03:25:14,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,953 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,964 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,964 INFO L85 PathProgramCache]: Analyzing trace with hash 995055026, now seen corresponding path program 1 times [2022-02-21 03:25:14,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932402022] [2022-02-21 03:25:14,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,980 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,993 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:15,129 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:15,131 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:15,131 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:15,131 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:15,131 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:15,131 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:15,132 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:15,132 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration4_Loop [2022-02-21 03:25:15,132 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:15,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:15,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,231 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:15,231 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,264 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:25:15,267 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:15,267 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:15,285 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:15,285 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: [] [2022-02-21 03:25:15,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 03:25:15,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,306 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:25:15,308 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:15,308 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:15,319 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:15,319 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: [] [2022-02-21 03:25:15,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,336 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:25:15,338 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:15,338 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:15,377 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:15,378 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x2~0#1=1} Honda state: {ULTIMATE.start_main_~x2~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:15,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,405 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:25:15,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:15,414 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:15,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,468 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:25:15,470 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:15,470 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:15,513 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:15,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,519 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:15,520 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:15,520 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:15,520 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:15,520 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:15,520 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,520 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:15,520 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:15,520 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration4_Loop [2022-02-21 03:25:15,520 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:15,520 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:15,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:15,607 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:15,610 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:15,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:25:15,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:15,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:15,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:15,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:15,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:15,625 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:15,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:15,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:15,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,652 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:25:15,654 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:15,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:15,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:15,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:15,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:15,662 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:15,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:15,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:15,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,699 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:25:15,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:15,707 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:15,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:15,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:15,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:15,708 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:15,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:15,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:15,712 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:15,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:25:15,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,729 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:25:15,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:15,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:15,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:15,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:15,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:15,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:15,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:15,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:15,740 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:15,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:15,743 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:15,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:15,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:15,748 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:15,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:25:15,750 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:15,750 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:15,750 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:15,751 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x1~0#1) = -2*ULTIMATE.start_main_~x1~0#1 + 21 Supporting invariants [] [2022-02-21 03:25:15,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,784 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:15,790 INFO L390 LassoCheck]: Loop: "assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" "assume !(main_~x2~0#1 > 1);" "main_~x1~0#1 := 1 + main_~x1~0#1;" [2022-02-21 03:25:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:15,816 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:15,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:15,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {228#unseeded} assume { :begin_inline_ULTIMATE.init } true; {228#unseeded} is VALID [2022-02-21 03:25:15,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {228#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {228#unseeded} is VALID [2022-02-21 03:25:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:15,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:15,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:15,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:15,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:15,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {231#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21))} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} assume !(main_~x2~0#1 > 1); {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} is VALID [2022-02-21 03:25:15,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {249#(and (<= |ULTIMATE.start_main_~x1~0#1| 10) (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21)))} main_~x1~0#1 := 1 + main_~x1~0#1; {241#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~x1~0#1|) 21))) unseeded)} is VALID [2022-02-21 03:25:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-02-21 03:25:15,993 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:15,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:15,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:15,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,001 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 [2022-02-21 03:25:16,001 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 2 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,029 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 15 transitions. cyclomatic complexity: 2. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 29 transitions. Complement of second has 4 states. [2022-02-21 03:25:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:16,029 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:16,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. cyclomatic complexity: 2 [2022-02-21 03:25:16,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,030 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:16,030 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 29 transitions. [2022-02-21 03:25:16,031 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,033 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 15 transitions. cyclomatic complexity: 2 [2022-02-21 03:25:16,035 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:25:16,036 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:16,036 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:16,036 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 29 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:16,036 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:16,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:25:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:25:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:25:16,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:16,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 12 letters. [2022-02-21 03:25:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 12 letters. [2022-02-21 03:25:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 12 letters. [2022-02-21 03:25:16,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 12 letters. [2022-02-21 03:25:16,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 12 letters. [2022-02-21 03:25:16,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 12 letters. [2022-02-21 03:25:16,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 12 letters. [2022-02-21 03:25:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 12 letters. [2022-02-21 03:25:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 12 letters. [2022-02-21 03:25:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 12 letters. [2022-02-21 03:25:16,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 12 letters. [2022-02-21 03:25:16,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 12 letters. [2022-02-21 03:25:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 12 letters. [2022-02-21 03:25:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 12 letters. [2022-02-21 03:25:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 12 letters. [2022-02-21 03:25:16,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 12 letters. [2022-02-21 03:25:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 12 letters. [2022-02-21 03:25:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 12 letters. [2022-02-21 03:25:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 12 letters. [2022-02-21 03:25:16,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 12 letters. [2022-02-21 03:25:16,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 12 letters. [2022-02-21 03:25:16,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 12 letters. [2022-02-21 03:25:16,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 12 letters. [2022-02-21 03:25:16,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 12 letters. [2022-02-21 03:25:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 12 letters. [2022-02-21 03:25:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 12 letters. [2022-02-21 03:25:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 12 letters. [2022-02-21 03:25:16,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 12 letters. [2022-02-21 03:25:16,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 12 letters. [2022-02-21 03:25:16,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 12 letters. [2022-02-21 03:25:16,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:16,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 29 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:25:16,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,051 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:16,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 12 letters. [2022-02-21 03:25:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 14 letters. Loop has 12 letters. [2022-02-21 03:25:16,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 24 letters. [2022-02-21 03:25:16,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 29 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:16,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 25 states and 28 transitions. [2022-02-21 03:25:16,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:25:16,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:25:16,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 28 transitions. [2022-02-21 03:25:16,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:16,059 INFO L681 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-02-21 03:25:16,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 28 transitions. [2022-02-21 03:25:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2022-02-21 03:25:16,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:16,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,061 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,061 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,061 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:16,063 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-21 03:25:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-21 03:25:16,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:16,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:16,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 28 transitions. [2022-02-21 03:25:16,064 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 25 states and 28 transitions. [2022-02-21 03:25:16,064 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:16,065 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-21 03:25:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-02-21 03:25:16,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:16,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:16,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:16,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-02-21 03:25:16,068 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:25:16,068 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-02-21 03:25:16,068 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:16,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2022-02-21 03:25:16,070 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,070 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:25:16,070 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:25:16,071 INFO L791 eck$LassoCheckResult]: Stem: 320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 315#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 317#L21-2 [2022-02-21 03:25:16,071 INFO L793 eck$LassoCheckResult]: Loop: 317#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 317#L21-2 [2022-02-21 03:25:16,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,071 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:25:16,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:16,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358296769] [2022-02-21 03:25:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,078 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,083 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:16,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,083 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2022-02-21 03:25:16,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:16,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311681323] [2022-02-21 03:25:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,096 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:16,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2022-02-21 03:25:16,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:16,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140647133] [2022-02-21 03:25:16,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,118 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,120 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:16,137 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:16,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:16,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:16,137 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:16,137 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:16,137 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:16,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:16,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration5_Loop [2022-02-21 03:25:16,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:16,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:16,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,186 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:16,186 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,187 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,190 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:16,190 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:25:16,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:16,212 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: [] [2022-02-21 03:25:16,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,237 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:25:16,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:16,239 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,263 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:16,264 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: [] [2022-02-21 03:25:16,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,289 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:25:16,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:16,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,341 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:16,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:25:16,392 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:16,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,398 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:16,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:16,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:16,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:16,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:16,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:16,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:16,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration5_Loop [2022-02-21 03:25:16,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:16,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:16,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,451 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:16,451 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:16,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,452 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:16,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:16,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:16,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:16,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:16,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:16,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:16,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:25:16,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:16,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,509 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:25:16,512 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:16,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:16,519 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:16,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:16,519 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:16,519 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:16,520 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:16,520 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:16,534 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:16,537 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:25:16,537 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:16,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,540 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:16,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:16,550 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:16,550 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0#1) = 1*ULTIMATE.start_main_~x2~0#1 Supporting invariants [] [2022-02-21 03:25:16,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:25:16,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,580 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:16,582 INFO L390 LassoCheck]: Loop: "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" [2022-02-21 03:25:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:16,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:16,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:16,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:16,604 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#unseeded} assume { :begin_inline_ULTIMATE.init } true; {430#unseeded} is VALID [2022-02-21 03:25:16,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {430#unseeded} is VALID [2022-02-21 03:25:16,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {430#unseeded} is VALID [2022-02-21 03:25:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:16,608 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:16,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:16,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {433#(>= oldRank0 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {443#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x2~0#1|)) unseeded)} is VALID [2022-02-21 03:25:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:16,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:16,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,616 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:16,616 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,636 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 32 states and 37 transitions. Complement of second has 5 states. [2022-02-21 03:25:16,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:16,636 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:16,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:16,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 37 transitions. [2022-02-21 03:25:16,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:16,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:16,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:16,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 37 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:16,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:16,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:16,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:16,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:16,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 37 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:16,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,655 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:16,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:16,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:16,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:16,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 37 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:16,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 32 transitions. [2022-02-21 03:25:16,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2022-02-21 03:25:16,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2022-02-21 03:25:16,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 32 transitions. [2022-02-21 03:25:16,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:16,659 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-21 03:25:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 32 transitions. [2022-02-21 03:25:16,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2022-02-21 03:25:16,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:16,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,660 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,660 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,661 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:16,662 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-21 03:25:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-21 03:25:16,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:16,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:16,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states and 32 transitions. [2022-02-21 03:25:16,663 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 28 states and 32 transitions. [2022-02-21 03:25:16,663 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:16,665 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-02-21 03:25:16,665 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-02-21 03:25:16,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:16,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:16,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:16,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-02-21 03:25:16,666 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:25:16,666 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-02-21 03:25:16,666 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:25:16,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2022-02-21 03:25:16,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:16,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:16,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:16,667 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1, 1] [2022-02-21 03:25:16,667 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:25:16,667 INFO L791 eck$LassoCheckResult]: Stem: 498#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 499#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 493#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 494#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 500#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 508#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 507#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 506#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 505#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 504#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 503#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 502#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 501#L21-2 assume !(main_~x2~0#1 > 1); 497#L21-3 main_~x1~0#1 := 1 + main_~x1~0#1; 495#L19-2 assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; 496#L21-2 [2022-02-21 03:25:16,667 INFO L793 eck$LassoCheckResult]: Loop: 496#L21-2 assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; 496#L21-2 [2022-02-21 03:25:16,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,668 INFO L85 PathProgramCache]: Analyzing trace with hash 781934745, now seen corresponding path program 2 times [2022-02-21 03:25:16,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:16,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033145058] [2022-02-21 03:25:16,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:16,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,687 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:16,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2022-02-21 03:25:16,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:16,688 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784994549] [2022-02-21 03:25:16,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:16,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,691 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,692 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:16,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:16,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1529826661, now seen corresponding path program 3 times [2022-02-21 03:25:16,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:16,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947512344] [2022-02-21 03:25:16,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,704 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:16,711 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:16,729 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:16,729 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:16,729 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:16,729 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:16,729 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:16,729 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,729 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:16,729 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:16,729 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration6_Loop [2022-02-21 03:25:16,729 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:16,729 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:16,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,790 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:16,790 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:16,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,792 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,805 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:16,805 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:25:16,820 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:16,821 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: [] [2022-02-21 03:25:16,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,846 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:25:16,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:16,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,894 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:25:16,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:16,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:16,920 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:16,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:16,924 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:16,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:16,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:16,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:16,924 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:16,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:16,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:16,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: Urban-WST2013-Fig2.c_Iteration6_Loop [2022-02-21 03:25:16,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:16,924 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:16,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:16,985 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:16,986 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:16,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:16,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:16,987 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:16,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:25:16,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:16,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:16,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:16,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:16,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:16,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:16,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:16,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:17,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:17,031 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:17,031 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:17,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:17,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:17,033 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:17,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:25:17,037 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:17,037 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:17,037 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:17,037 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x2~0#1) = 1*ULTIMATE.start_main_~x2~0#1 Supporting invariants [] [2022-02-21 03:25:17,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:17,060 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:17,063 INFO L390 LassoCheck]: Loop: "assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1;" [2022-02-21 03:25:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:17,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#unseeded} assume { :begin_inline_ULTIMATE.init } true; {678#unseeded} is VALID [2022-02-21 03:25:17,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {678#unseeded} is VALID [2022-02-21 03:25:17,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {678#unseeded} is VALID [2022-02-21 03:25:17,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#unseeded} assume !(main_~x2~0#1 > 1); {678#unseeded} is VALID [2022-02-21 03:25:17,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#unseeded} main_~x1~0#1 := 1 + main_~x1~0#1; {678#unseeded} is VALID [2022-02-21 03:25:17,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {678#unseeded} is VALID [2022-02-21 03:25:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,135 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:17,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {681#(>= oldRank0 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {691#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x2~0#1|)) unseeded)} is VALID [2022-02-21 03:25:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:17,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:17,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,144 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:17,144 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,160 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 34 transitions. Complement of second has 5 states. [2022-02-21 03:25:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:17,160 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:17,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2022-02-21 03:25:17,162 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,162 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,163 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,163 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,163 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,163 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 34 transitions. cyclomatic complexity: 7 [2022-02-21 03:25:17,164 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:17,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:17,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:17,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,171 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:17,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,173 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:17,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#unseeded} assume { :begin_inline_ULTIMATE.init } true; {678#unseeded} is VALID [2022-02-21 03:25:17,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {678#unseeded} is VALID [2022-02-21 03:25:17,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {678#unseeded} is VALID [2022-02-21 03:25:17,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,221 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,223 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#unseeded} assume !(main_~x2~0#1 > 1); {678#unseeded} is VALID [2022-02-21 03:25:17,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#unseeded} main_~x1~0#1 := 1 + main_~x1~0#1; {678#unseeded} is VALID [2022-02-21 03:25:17,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {678#unseeded} is VALID [2022-02-21 03:25:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,228 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:17,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {681#(>= oldRank0 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {691#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x2~0#1|)) unseeded)} is VALID [2022-02-21 03:25:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:17,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:17,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:17,236 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,248 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 30 states and 34 transitions. Complement of second has 5 states. [2022-02-21 03:25:17,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:17,248 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:17,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 34 transitions. [2022-02-21 03:25:17,250 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,250 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,251 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,251 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,251 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 34 transitions. cyclomatic complexity: 7 [2022-02-21 03:25:17,251 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:17,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 30 letters. Loop has 30 letters. [2022-02-21 03:25:17,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 34 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,259 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:17,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,261 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:17,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:17,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#unseeded} assume { :begin_inline_ULTIMATE.init } true; {678#unseeded} is VALID [2022-02-21 03:25:17,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x1~0#1, main_~x2~0#1;havoc main_~x1~0#1;havoc main_~x2~0#1;main_~x1~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x2~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {678#unseeded} is VALID [2022-02-21 03:25:17,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {678#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {678#unseeded} is VALID [2022-02-21 03:25:17,308 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#unseeded} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {678#unseeded} is VALID [2022-02-21 03:25:17,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#unseeded} assume !(main_~x2~0#1 > 1); {678#unseeded} is VALID [2022-02-21 03:25:17,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#unseeded} main_~x1~0#1 := 1 + main_~x1~0#1; {678#unseeded} is VALID [2022-02-21 03:25:17,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#unseeded} assume !!(main_~x1~0#1 <= 10);main_~x2~0#1 := 10; {678#unseeded} is VALID [2022-02-21 03:25:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,315 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:17,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:17,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {681#(>= oldRank0 |ULTIMATE.start_main_~x2~0#1|)} assume !!(main_~x2~0#1 > 1);main_~x2~0#1 := main_~x2~0#1 - 1; {691#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x2~0#1|)) unseeded)} is VALID [2022-02-21 03:25:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:17,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:17,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,323 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:17,323 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 18 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 19 states and 21 transitions. Complement of second has 4 states. [2022-02-21 03:25:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:17,339 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:17,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:17,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:17,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-02-21 03:25:17,364 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:17,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:17,364 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 18 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,364 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,364 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:17,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:17,365 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:17,365 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 21 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:17,365 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:17,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:17,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:25:17,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:17,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:17,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 18 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 21 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:17,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,372 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:25:17,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 1 letters. [2022-02-21 03:25:17,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 16 letters. Loop has 1 letters. [2022-02-21 03:25:17,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:25:17,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:17,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:17,374 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:17,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2022-02-21 03:25:17,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:17,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:17,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:17,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:17,375 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:17,375 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:17,375 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:17,375 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:25:17,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:25:17,376 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:17,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:17,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:25:17 BoogieIcfgContainer [2022-02-21 03:25:17,381 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:25:17,382 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:25:17,382 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:25:17,382 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:25:17,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:13" (3/4) ... [2022-02-21 03:25:17,384 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:25:17,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:25:17,386 INFO L158 Benchmark]: Toolchain (without parser) took 4202.69ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 58.2MB in the beginning and 82.6MB in the end (delta: -24.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:17,386 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:17,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.11ms. Allocated memory is still 92.3MB. Free memory was 58.0MB in the beginning and 69.4MB in the end (delta: -11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:17,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.71ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:17,387 INFO L158 Benchmark]: Boogie Preprocessor took 18.89ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 67.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:25:17,387 INFO L158 Benchmark]: RCFGBuilder took 180.54ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 59.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:17,387 INFO L158 Benchmark]: BuchiAutomizer took 3743.33ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 59.0MB in the beginning and 83.7MB in the end (delta: -24.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:17,388 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 111.1MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:17,389 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 75.5MB. Free memory was 54.3MB in the beginning and 54.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.11ms. Allocated memory is still 92.3MB. Free memory was 58.0MB in the beginning and 69.4MB in the end (delta: -11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.71ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 68.2MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.89ms. Allocated memory is still 92.3MB. Free memory was 68.2MB in the beginning and 67.0MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 180.54ms. Allocated memory is still 92.3MB. Free memory was 67.0MB in the beginning and 59.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3743.33ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 59.0MB in the beginning and 83.7MB in the end (delta: -24.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 111.1MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x1 + 21 and consists of 3 locations. One deterministic module has affine ranking function x2 and consists of 3 locations. One nondeterministic module has affine ranking function x2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 7 iterations. TraceHistogramMax:9. Analysis of lassos took 2.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 4. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 46 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax204 hnf100 lsp42 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:25:17,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:17,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-21 03:25:17,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE