./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.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 7c08193784b646afd298f73ae6296b7af2e0cac1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:31,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:31,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:31,390 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:31,391 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:31,393 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:31,395 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:31,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:31,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:31,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:31,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:31,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:31,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:31,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:31,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:31,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:31,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:31,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:31,428 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:31,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:31,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:31,439 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:31,440 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:31,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:31,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:31,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:31,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:31,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:31,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:31,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:31,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:31,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:31,451 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:31,452 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:31,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:31,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:31,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:31,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:31,458 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:31,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:31,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:31,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:31,482 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:31,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:31,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:31,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:31,484 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:31,484 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:31,485 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:31,485 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:31,485 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:31,485 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:31,486 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:31,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:31,487 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:31,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:31,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:31,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:31,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:31,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:31,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:31,488 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:31,489 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:31,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:31,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:31,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:31,490 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:31,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:31,490 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:31,490 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:31,490 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:31,492 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:31,492 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7c08193784b646afd298f73ae6296b7af2e0cac1 [2020-07-29 01:28:31,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:31,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:31,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:31,808 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:31,809 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:31,809 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c [2020-07-29 01:28:31,889 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eeda0264/8e35949ff92c47d6870a42110c8fb60f/FLAG668e0f828 [2020-07-29 01:28:32,382 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:32,383 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/BrockschmidtCookFuhs-CAV2013-Fig1.c [2020-07-29 01:28:32,389 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eeda0264/8e35949ff92c47d6870a42110c8fb60f/FLAG668e0f828 [2020-07-29 01:28:32,727 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4eeda0264/8e35949ff92c47d6870a42110c8fb60f [2020-07-29 01:28:32,731 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:32,734 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:32,735 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:32,735 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:32,738 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:32,740 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@102c2ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32, skipping insertion in model container [2020-07-29 01:28:32,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:32,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:32,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:32,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:32,944 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:32,972 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:32,987 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:32,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32 WrapperNode [2020-07-29 01:28:32,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:32,990 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:32,990 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:32,990 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:33,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,005 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:33,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:33,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:33,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:33,092 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,103 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... [2020-07-29 01:28:33,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:33,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:33,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:33,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:33,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:33,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:33,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:33,329 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:33,330 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:28:33,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:33 BoogieIcfgContainer [2020-07-29 01:28:33,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:33,334 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:33,334 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:33,337 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:33,337 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:33,338 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:32" (1/3) ... [2020-07-29 01:28:33,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@560f7baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:33, skipping insertion in model container [2020-07-29 01:28:33,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:33,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:32" (2/3) ... [2020-07-29 01:28:33,339 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@560f7baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:33, skipping insertion in model container [2020-07-29 01:28:33,339 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:33,339 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:33" (3/3) ... [2020-07-29 01:28:33,341 INFO L371 chiAutomizerObserver]: Analyzing ICFG BrockschmidtCookFuhs-CAV2013-Fig1.c [2020-07-29 01:28:33,400 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:33,400 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:33,401 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:33,401 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:33,401 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:33,401 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:33,401 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:33,401 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:33,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:33,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:33,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:33,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:33,470 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:33,470 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:33,471 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:33,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:33,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:33,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:33,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:33,475 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:33,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:33,485 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 6#L19-2true [2020-07-29 01:28:33,485 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 9#L21-2true assume !(main_~j~0 <= main_~i~0); 8#L21-3true main_~i~0 := 1 + main_~i~0; 6#L19-2true [2020-07-29 01:28:33,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:33,493 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:33,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:33,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109736183] [2020-07-29 01:28:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:33,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:28:33,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:33,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661744978] [2020-07-29 01:28:33,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:33,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,628 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,630 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash 963472, now seen corresponding path program 1 times [2020-07-29 01:28:33,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:33,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121874666] [2020-07-29 01:28:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,641 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:33,649 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:33,653 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:33,769 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:33,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:33,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:33,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:33,771 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:33,772 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:33,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:33,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:33,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration1_Loop [2020-07-29 01:28:33,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:33,773 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:33,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:33,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:33,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:33,992 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:33,993 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:34,001 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:34,001 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,012 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:34,012 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,053 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:34,053 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:34,059 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:34,059 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:34,097 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:34,153 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:34,153 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,355 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:34,357 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:34,358 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:34,358 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:34,358 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:34,359 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:34,359 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,359 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:34,359 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:34,359 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration1_Loop [2020-07-29 01:28:34,360 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:34,360 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:34,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:34,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:34,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:34,518 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:34,523 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:34,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:34,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:34,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:34,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:34,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:34,547 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:34,547 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:34,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:34,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:34,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:34,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:34,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:34,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:34,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,648 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:34,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:34,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:34,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:34,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:34,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:34,654 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:34,655 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:34,659 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:34,666 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:34,666 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:34,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:34,681 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:34,681 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:34,682 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:34,726 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:34,730 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" "assume !(main_~j~0 <= main_~i~0);" "main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:28:34,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:34,807 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; {18#unseeded} is VALID [2020-07-29 01:28:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,813 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:28:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:34,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:34,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {36#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-29 01:28:34,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= ULTIMATE.start_main_~j~0 0))} assume !(main_~j~0 <= main_~i~0); {40#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~i~0 1) 0))} is VALID [2020-07-29 01:28:34,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#(and (<= 0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= (+ ULTIMATE.start_main_~i~0 1) 0))} main_~i~0 := 1 + main_~i~0; {31#(or unseeded (and (>= oldRank0 0) (> oldRank0 (* (- 1) ULTIMATE.start_main_~i~0))))} is VALID [2020-07-29 01:28:34,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:34,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:34,975 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:34,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:34,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:34,991 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:34,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2020-07-29 01:28:35,187 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 30 states and 48 transitions. Complement of second has 9 states. [2020-07-29 01:28:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:35,188 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:35,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:35,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:35,194 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:35,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:28:35,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 48 transitions. [2020-07-29 01:28:35,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:35,207 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,207 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,211 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:35,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:35,216 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:35,216 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:35,224 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:28:35,226 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:35,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 48 transitions. cyclomatic complexity: 21 [2020-07-29 01:28:35,227 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:35,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:35,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:35,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:35,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:35,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:35,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:35,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:35,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:35,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:35,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:35,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:35,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:35,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:35,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:35,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:35,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:35,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:35,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:35,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:35,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:35,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:35,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:35,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:35,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:35,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:35,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:35,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:35,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 48 transitions. cyclomatic complexity: 21 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:35,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,277 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2020-07-29 01:28:35,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:35,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:35,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:35,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:35,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 48 transitions. cyclomatic complexity: 21 [2020-07-29 01:28:35,304 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:35,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 13 states and 18 transitions. [2020-07-29 01:28:35,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:35,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:35,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-07-29 01:28:35,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:35,313 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-29 01:28:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-07-29 01:28:35,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:28:35,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:35,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand 12 states. [2020-07-29 01:28:35,346 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand 12 states. [2020-07-29 01:28:35,349 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand 12 states. [2020-07-29 01:28:35,352 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:35,355 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-29 01:28:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2020-07-29 01:28:35,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:35,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:35,357 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 18 transitions. [2020-07-29 01:28:35,358 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 18 transitions. [2020-07-29 01:28:35,358 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:35,360 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-07-29 01:28:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:28:35,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:35,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:35,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:35,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:28:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:28:35,365 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:35,365 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:35,365 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:35,365 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:35,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:35,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:35,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:35,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:35,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:35,368 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 89#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 91#L21-2 [2020-07-29 01:28:35,368 INFO L796 eck$LassoCheckResult]: Loop: 91#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 97#L21-2 assume !(main_~j~0 <= main_~i~0); 94#L21-3 main_~i~0 := 1 + main_~i~0; 90#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 91#L21-2 [2020-07-29 01:28:35,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:35,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584147018] [2020-07-29 01:28:35,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,380 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1506610, now seen corresponding path program 1 times [2020-07-29 01:28:35,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055630909] [2020-07-29 01:28:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,391 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,398 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 1 times [2020-07-29 01:28:35,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:35,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931774070] [2020-07-29 01:28:35,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,408 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:35,416 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:35,418 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:35,462 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:35,462 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:35,462 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:35,462 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:35,462 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:35,462 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,463 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:35,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:35,463 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration2_Loop [2020-07-29 01:28:35,463 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:35,464 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:35,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:35,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:35,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:35,626 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:35,626 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:35,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:35,630 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,636 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:35,636 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:35,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:35,681 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,687 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:35,687 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:35,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:35,738 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:35,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:35,793 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,952 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:35,955 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:35,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:35,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:35,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:35,956 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:35,956 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:35,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:35,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:35,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration2_Loop [2020-07-29 01:28:35,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:35,957 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:35,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:35,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:35,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:36,095 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:36,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:36,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:36,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:36,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:36,111 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:36,111 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:36,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:36,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:36,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:36,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:36,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:36,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:36,152 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:36,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:36,181 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:36,181 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:36,181 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:36,181 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:36,181 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:36,183 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:36,183 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:36,187 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:36,190 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:36,191 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:36,194 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:36,195 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:36,195 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:28:36,217 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:36,222 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0;" "assume !(main_~j~0 <= main_~i~0);" "main_~i~0 := 1 + main_~i~0;" "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" [2020-07-29 01:28:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:36,264 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; {161#unseeded} is VALID [2020-07-29 01:28:36,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {161#unseeded} is VALID [2020-07-29 01:28:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:36,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:36,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:36,330 INFO L280 TraceCheckUtils]: 0: Hoare triple {164#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {164#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 01:28:36,331 INFO L280 TraceCheckUtils]: 1: Hoare triple {164#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !(main_~j~0 <= main_~i~0); {164#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 01:28:36,333 INFO L280 TraceCheckUtils]: 2: Hoare triple {164#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} main_~i~0 := 1 + main_~i~0; {188#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:36,334 INFO L280 TraceCheckUtils]: 3: Hoare triple {188#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {174#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:28:36,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:36,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:36,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,346 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 [2020-07-29 01:28:36,346 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:28:36,454 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 22 states and 31 transitions. Complement of second has 6 states. [2020-07-29 01:28:36,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:36,455 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:36,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:36,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:36,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:36,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 31 transitions. [2020-07-29 01:28:36,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:36,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:36,467 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:36,467 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:36,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:36,469 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:36,469 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:36,470 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:36,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:36,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:36,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:36,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:36,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:36,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:36,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:28:36,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:28:36,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:28:36,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:36,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:36,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:36,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:36,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:36,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:36,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:36,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:36,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:36,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:36,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:36,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:36,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:36,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:36,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:36,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 31 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:36,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,490 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:36,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2020-07-29 01:28:36,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:36,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:28:36,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:36,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:36,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:36,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 15 states and 22 transitions. [2020-07-29 01:28:36,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:36,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:36,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2020-07-29 01:28:36,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:36,507 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2020-07-29 01:28:36,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2020-07-29 01:28:36,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2020-07-29 01:28:36,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:36,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 22 transitions. Second operand 14 states. [2020-07-29 01:28:36,513 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 22 transitions. Second operand 14 states. [2020-07-29 01:28:36,514 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand 14 states. [2020-07-29 01:28:36,514 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:36,516 INFO L93 Difference]: Finished difference Result 16 states and 24 transitions. [2020-07-29 01:28:36,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2020-07-29 01:28:36,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:36,518 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states and 22 transitions. [2020-07-29 01:28:36,518 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states and 22 transitions. [2020-07-29 01:28:36,527 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:36,532 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2020-07-29 01:28:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-07-29 01:28:36,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:36,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:36,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:36,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:28:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-07-29 01:28:36,535 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-29 01:28:36,535 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-29 01:28:36,535 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:36,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:28:36,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:36,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:36,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:36,538 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:36,538 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:36,539 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 224#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 225#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 229#L21-2 [2020-07-29 01:28:36,539 INFO L796 eck$LassoCheckResult]: Loop: 229#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 229#L21-2 [2020-07-29 01:28:36,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,539 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:28:36,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:36,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731948618] [2020-07-29 01:28:36,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,560 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,571 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,575 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:28:36,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:36,576 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111609003] [2020-07-29 01:28:36,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,591 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:36,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:36,596 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2020-07-29 01:28:36,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:36,596 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936513401] [2020-07-29 01:28:36,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:36,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:36,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:36,638 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:36,639 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:36,639 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:36,639 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:36,639 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:36,639 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,639 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:36,639 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:36,639 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration3_Loop [2020-07-29 01:28:36,639 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:36,639 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:36,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,741 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:36,742 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:36,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:36,751 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,786 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:36,786 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:36,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:36,958 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:36,960 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:36,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:36,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:36,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:36,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:36,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:36,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:36,961 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:36,961 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration3_Loop [2020-07-29 01:28:36,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:36,961 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:36,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:36,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,072 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:37,073 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:37,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:37,087 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:37,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:37,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:37,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:37,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:37,120 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:37,129 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:37,129 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,140 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:37,140 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:37,140 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:37,140 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-07-29 01:28:37,162 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:37,164 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0;" [2020-07-29 01:28:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,199 INFO L280 TraceCheckUtils]: 0: Hoare triple {307#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; {307#unseeded} is VALID [2020-07-29 01:28:37,200 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {307#unseeded} is VALID [2020-07-29 01:28:37,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {307#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {307#unseeded} is VALID [2020-07-29 01:28:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,208 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,214 INFO L280 TraceCheckUtils]: 0: Hoare triple {310#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {320#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:37,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:37,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:37,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,222 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 [2020-07-29 01:28:37,222 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10 Second operand 2 states. [2020-07-29 01:28:37,261 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 26 states and 38 transitions. Complement of second has 5 states. [2020-07-29 01:28:37,261 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 [2020-07-29 01:28:37,261 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:37,262 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,262 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:37,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 38 transitions. [2020-07-29 01:28:37,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,266 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:37,266 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,266 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:37,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,267 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,268 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 38 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:37,268 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:28:37,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:28:37,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 26 letters. [2020-07-29 01:28:37,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:37,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:37,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:37,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:37,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,279 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:37,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:37,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:37,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 38 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:37,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 22 states and 33 transitions. [2020-07-29 01:28:37,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:37,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:37,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2020-07-29 01:28:37,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:37,285 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-29 01:28:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2020-07-29 01:28:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2020-07-29 01:28:37,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:37,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 33 transitions. Second operand 18 states. [2020-07-29 01:28:37,288 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 33 transitions. Second operand 18 states. [2020-07-29 01:28:37,288 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 18 states. [2020-07-29 01:28:37,288 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:37,290 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2020-07-29 01:28:37,291 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2020-07-29 01:28:37,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,291 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 22 states and 33 transitions. [2020-07-29 01:28:37,292 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 22 states and 33 transitions. [2020-07-29 01:28:37,292 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:37,294 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2020-07-29 01:28:37,294 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2020-07-29 01:28:37,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:37,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:37,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:37,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:28:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-07-29 01:28:37,297 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:28:37,297 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:28:37,297 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:37,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2020-07-29 01:28:37,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,299 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2020-07-29 01:28:37,299 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:37,299 INFO L794 eck$LassoCheckResult]: Stem: 364#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 365#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 366#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 372#L21-2 assume !(main_~j~0 <= main_~i~0); 380#L21-3 main_~i~0 := 1 + main_~i~0; 379#L19-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 375#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 376#L21-2 [2020-07-29 01:28:37,300 INFO L796 eck$LassoCheckResult]: Loop: 376#L21-2 assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; 376#L21-2 [2020-07-29 01:28:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1360285992, now seen corresponding path program 2 times [2020-07-29 01:28:37,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825537996] [2020-07-29 01:28:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,312 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,320 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:28:37,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,322 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259847040] [2020-07-29 01:28:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,325 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,328 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash 780807227, now seen corresponding path program 3 times [2020-07-29 01:28:37,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:37,330 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758660168] [2020-07-29 01:28:37,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,338 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:37,345 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:37,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:37,360 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:37,360 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:37,360 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:37,360 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:37,360 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:37,361 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,361 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:37,361 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:37,361 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration4_Loop [2020-07-29 01:28:37,361 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:37,361 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:37,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,472 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:37,472 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:37,476 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:37,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:37,520 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,671 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:37,672 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:37,672 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:37,672 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:37,672 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:37,673 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:37,673 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,673 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:37,673 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:37,673 INFO L133 ssoRankerPreferences]: Filename of dumped script: BrockschmidtCookFuhs-CAV2013-Fig1.c_Iteration4_Loop [2020-07-29 01:28:37,673 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:37,673 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:37,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:37,773 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:37,774 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:37,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:37,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:37,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:37,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:37,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:37,783 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:37,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:37,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:37,789 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:37,789 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:37,791 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:37,792 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:37,792 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:37,792 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-07-29 01:28:37,814 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:37,817 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0;" [2020-07-29 01:28:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,857 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; {472#unseeded} is VALID [2020-07-29 01:28:37,858 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {472#unseeded} is VALID [2020-07-29 01:28:37,859 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {472#unseeded} is VALID [2020-07-29 01:28:37,859 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#unseeded} assume !(main_~j~0 <= main_~i~0); {472#unseeded} is VALID [2020-07-29 01:28:37,860 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#unseeded} main_~i~0 := 1 + main_~i~0; {472#unseeded} is VALID [2020-07-29 01:28:37,860 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {472#unseeded} is VALID [2020-07-29 01:28:37,861 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {472#unseeded} is VALID [2020-07-29 01:28:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,865 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,871 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {485#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:37,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:37,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:37,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,877 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 [2020-07-29 01:28:37,877 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 01:28:37,905 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 24 states and 35 transitions. Complement of second has 5 states. [2020-07-29 01:28:37,906 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 [2020-07-29 01:28:37,906 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:37,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:37,907 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:28:37,909 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:37,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:37,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:28:37,914 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:37,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:37,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:37,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,922 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:37,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,923 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,957 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; {472#unseeded} is VALID [2020-07-29 01:28:37,958 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {472#unseeded} is VALID [2020-07-29 01:28:37,959 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {472#unseeded} is VALID [2020-07-29 01:28:37,960 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#unseeded} assume !(main_~j~0 <= main_~i~0); {472#unseeded} is VALID [2020-07-29 01:28:37,960 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#unseeded} main_~i~0 := 1 + main_~i~0; {472#unseeded} is VALID [2020-07-29 01:28:37,961 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {472#unseeded} is VALID [2020-07-29 01:28:37,961 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {472#unseeded} is VALID [2020-07-29 01:28:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,965 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:37,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:37,969 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {485#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:37,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:37,974 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:37,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:37,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:37,974 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 [2020-07-29 01:28:37,974 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 01:28:37,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 24 states and 35 transitions. Complement of second has 5 states. [2020-07-29 01:28:37,996 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 [2020-07-29 01:28:37,996 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:37,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:37,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:37,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:28:37,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:37,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:37,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:37,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:37,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:37,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:37,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:38,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:38,000 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:28:38,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:38,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:38,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:38,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:28:38,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:38,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,007 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:38,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:38,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:38,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,008 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:38,042 INFO L280 TraceCheckUtils]: 0: Hoare triple {472#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~i~0, main_~j~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~n~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; {472#unseeded} is VALID [2020-07-29 01:28:38,043 INFO L280 TraceCheckUtils]: 1: Hoare triple {472#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {472#unseeded} is VALID [2020-07-29 01:28:38,043 INFO L280 TraceCheckUtils]: 2: Hoare triple {472#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {472#unseeded} is VALID [2020-07-29 01:28:38,044 INFO L280 TraceCheckUtils]: 3: Hoare triple {472#unseeded} assume !(main_~j~0 <= main_~i~0); {472#unseeded} is VALID [2020-07-29 01:28:38,044 INFO L280 TraceCheckUtils]: 4: Hoare triple {472#unseeded} main_~i~0 := 1 + main_~i~0; {472#unseeded} is VALID [2020-07-29 01:28:38,045 INFO L280 TraceCheckUtils]: 5: Hoare triple {472#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {472#unseeded} is VALID [2020-07-29 01:28:38,045 INFO L280 TraceCheckUtils]: 6: Hoare triple {472#unseeded} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {472#unseeded} is VALID [2020-07-29 01:28:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,049 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:38,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:38,054 INFO L280 TraceCheckUtils]: 0: Hoare triple {475#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1))} assume !!(main_~j~0 <= main_~i~0);main_~j~0 := 1 + main_~j~0; {485#(or (and (> oldRank0 (+ (* 2 ULTIMATE.start_main_~i~0) (* (- 2) ULTIMATE.start_main_~j~0) 1)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:38,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:38,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:38,062 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:38,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,063 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 [2020-07-29 01:28:38,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 2 states. [2020-07-29 01:28:38,089 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 21 states and 30 transitions. Complement of second has 4 states. [2020-07-29 01:28:38,089 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 [2020-07-29 01:28:38,089 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:38,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:38,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:38,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:38,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:38,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:38,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:38,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:38,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:28:38,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:38,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:38,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:38,091 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:38,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:38,092 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:38,092 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:38,092 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:38,092 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:38,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:38,093 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:38,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:28:38,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:28:38,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:28:38,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:38,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:38,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:38,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:38,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 30 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:38,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,098 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:28:38,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:38,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:38,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:38,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:38,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 30 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:38,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:38,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 0 states and 0 transitions. [2020-07-29 01:28:38,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:38,101 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:38,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:38,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:38,102 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:38,102 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:38,102 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:38,102 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:38,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:38,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:38,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:38,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:38 BoogieIcfgContainer [2020-07-29 01:28:38,110 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:38,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:38,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:38,111 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:38,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:33" (3/4) ... [2020-07-29 01:28:38,115 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:38,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:38,118 INFO L168 Benchmark]: Toolchain (without parser) took 5385.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.6 MB). Free memory was 962.9 MB in the beginning and 985.0 MB in the end (delta: -22.1 MB). Peak memory consumption was 195.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:38,119 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:38,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.44 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:38,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.69 ms. Allocated memory is still 1.0 GB. Free memory is still 952.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:38,120 INFO L168 Benchmark]: Boogie Preprocessor took 80.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:38,121 INFO L168 Benchmark]: RCFGBuilder took 227.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:38,122 INFO L168 Benchmark]: BuchiAutomizer took 4776.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 985.0 MB in the end (delta: 132.3 MB). Peak memory consumption was 204.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:38,122 INFO L168 Benchmark]: Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:38,126 INFO L336 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 253.44 ms. Allocated memory is still 1.0 GB. Free memory was 962.9 MB in the beginning and 952.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.69 ms. Allocated memory is still 1.0 GB. Free memory is still 952.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 227.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4776.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 985.0 MB in the end (delta: 132.3 MB). Peak memory consumption was 204.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.74 ms. Allocated memory is still 1.2 GB. Free memory is still 985.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * i and consists of 6 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 3 locations. One nondeterministic module has affine ranking function 2 * i + -2 * j + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 18 states and ocurred in iteration 3. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 26 SDtfs, 39 SDslu, 9 SDs, 0 SdLazy, 50 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax191 hnf98 lsp52 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf110 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...