./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-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/HarrisLalNoriRajamani-SAS2010-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 c0bce2603970e0a002a5b33cfd00ef3446011286 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:45,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:45,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:45,446 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:45,446 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:45,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:45,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:45,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:45,465 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:45,469 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:45,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:45,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:45,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:45,477 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:45,478 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:45,479 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:45,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:45,482 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:45,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:45,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:45,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:45,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:45,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:45,503 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:45,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:45,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:45,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:45,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:45,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:45,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:45,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:45,512 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:45,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:45,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:45,515 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:45,515 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:45,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:45,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:45,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:45,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:45,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:45,520 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:45,549 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:45,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:45,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:45,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:45,556 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:45,556 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:45,556 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:45,556 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:45,557 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:45,557 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:45,557 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:45,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:45,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:45,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:45,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:45,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:45,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:45,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:45,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:45,559 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:45,559 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:45,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:45,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:45,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:45,560 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:45,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:45,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:45,561 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:45,561 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:45,562 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:45,562 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 -> c0bce2603970e0a002a5b33cfd00ef3446011286 [2020-07-29 01:28:45,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:45,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:45,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:45,913 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:45,914 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:45,915 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c [2020-07-29 01:28:45,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b0ce8fc/24d45b0c544a4beaafd26ed5a5b83fcf/FLAG2c8c805c5 [2020-07-29 01:28:46,488 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:46,489 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HarrisLalNoriRajamani-SAS2010-Fig1.c [2020-07-29 01:28:46,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b0ce8fc/24d45b0c544a4beaafd26ed5a5b83fcf/FLAG2c8c805c5 [2020-07-29 01:28:46,912 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b0ce8fc/24d45b0c544a4beaafd26ed5a5b83fcf [2020-07-29 01:28:46,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:46,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:46,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:46,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:46,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:46,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,934 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12f357db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46, skipping insertion in model container [2020-07-29 01:28:46,934 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:46,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:47,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:47,153 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:47,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:47,187 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:47,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:47 WrapperNode [2020-07-29 01:28:47,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:47,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:47,189 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:47,189 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:47,198 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:47" (1/1) ... [2020-07-29 01:28:47,204 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:47" (1/1) ... [2020-07-29 01:28:47,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:47,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:47,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:47,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:47,300 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:47" (1/1) ... [2020-07-29 01:28:47,300 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:47" (1/1) ... [2020-07-29 01:28:47,301 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:47" (1/1) ... [2020-07-29 01:28:47,302 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:47" (1/1) ... [2020-07-29 01:28:47,305 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:47" (1/1) ... [2020-07-29 01:28:47,313 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:47" (1/1) ... [2020-07-29 01:28:47,314 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:47" (1/1) ... [2020-07-29 01:28:47,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:47,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:47,318 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:47,318 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:47,319 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:47" (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:47,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:47,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:47,637 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:47,638 INFO L295 CfgBuilder]: Removed 12 assume(true) statements. [2020-07-29 01:28:47,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:47 BoogieIcfgContainer [2020-07-29 01:28:47,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:47,643 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:47,644 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:47,648 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:47,649 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:47,649 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:46" (1/3) ... [2020-07-29 01:28:47,651 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42a3c736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:47, skipping insertion in model container [2020-07-29 01:28:47,651 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:47,651 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:47" (2/3) ... [2020-07-29 01:28:47,652 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@42a3c736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:47, skipping insertion in model container [2020-07-29 01:28:47,652 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:47,652 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:47" (3/3) ... [2020-07-29 01:28:47,654 INFO L371 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-SAS2010-Fig1.c [2020-07-29 01:28:47,737 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:47,738 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:47,738 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:47,738 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:47,739 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:47,739 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:47,739 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:47,740 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:47,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:28:47,795 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 01:28:47,796 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,802 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:47,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:47,802 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:47,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:28:47,808 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 01:28:47,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,808 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:47,809 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:47,816 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5; 10#L41true assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 6#L18true assume !(f_~k~0 > 1073741823); 13#L23-1true [2020-07-29 01:28:47,816 INFO L796 eck$LassoCheckResult]: Loop: 13#L23-1true assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 13#L23-1true [2020-07-29 01:28:47,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,821 INFO L82 PathProgramCache]: Analyzing trace with hash 30885, now seen corresponding path program 1 times [2020-07-29 01:28:47,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814492598] [2020-07-29 01:28:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,905 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash 49, now seen corresponding path program 1 times [2020-07-29 01:28:47,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259334158] [2020-07-29 01:28:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,944 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:47,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,946 INFO L82 PathProgramCache]: Analyzing trace with hash 957453, now seen corresponding path program 1 times [2020-07-29 01:28:47,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:47,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210734728] [2020-07-29 01:28:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:47,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:47,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,125 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:48,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:48,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:48,127 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:48,127 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:48,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:48,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:48,129 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration1_Lasso [2020-07-29 01:28:48,129 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:48,129 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:48,168 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:48,182 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:48,188 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:48,194 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:48,199 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:48,205 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:48,210 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:48,229 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:48,234 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:48,240 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:48,245 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:48,511 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:48,512 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:48,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,520 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:48,527 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,528 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=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) [2020-07-29 01:28:48,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,569 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,574 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,574 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,609 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,610 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,614 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,614 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,648 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:48,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,651 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,678 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,679 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:48,683 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,683 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,724 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:48,732 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,732 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,781 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:48,836 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,909 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-29 01:29:00,915 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:00,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:00,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:00,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:00,916 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:00,916 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,916 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:00,916 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:00,916 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration1_Lasso [2020-07-29 01:29:00,917 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:00,917 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:00,927 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:29:00,931 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:29:00,935 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:29:00,940 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:29:00,944 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:29:00,948 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:29:00,959 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:29:00,963 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:29:00,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:29:00,971 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:29:00,975 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:29:01,212 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:01,218 INFO L489 LassoAnalysis]: Using template 'affine'. 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:29:01,224 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:29:01,227 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:01,231 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,233 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:01,274 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:29:01,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,276 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,276 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:01,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,279 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:01,322 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:29:01,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,325 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:01,325 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,328 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,358 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:29:01,360 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:01,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:01,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,400 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:29:01,402 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:01,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,404 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:01,404 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:01,405 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:29:01,429 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:29:01,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:01,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:01,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:01,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:01,438 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:01,438 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:01,450 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:01,566 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:29:01,567 INFO L444 ModelExtractionUtils]: 2 out of 10 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:01,587 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,592 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-07-29 01:29:01,593 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:01,594 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0) = -2*ULTIMATE.start_f_~z~0 + 2147483645 Supporting invariants [-1*ULTIMATE.start_f_~k~0 + 1073741823 >= 0, 1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2020-07-29 01:29:01,646 INFO L297 tatePredicateManager]: 0 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 01:29:01,658 INFO L393 LassoCheck]: Loop: "assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0;" [2020-07-29 01:29:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:01,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:01,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:01,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:01,759 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet5; {25#unseeded} is VALID [2020-07-29 01:29:01,760 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {62#(and (<= 1 ULTIMATE.start_f_~z~0) unseeded)} is VALID [2020-07-29 01:29:01,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {62#(and (<= 1 ULTIMATE.start_f_~z~0) unseeded)} assume !(f_~k~0 > 1073741823); {50#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) (>= (+ (* (- 1) ULTIMATE.start_f_~k~0) 1073741823) 0) unseeded)} is VALID [2020-07-29 01:29:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:01,766 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:01,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:01,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:01,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {51#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) (>= (+ (* (- 1) ULTIMATE.start_f_~k~0) 1073741823) 0) (>= oldRank0 (+ (* (- 2) ULTIMATE.start_f_~z~0) 2147483645)))} assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; {53#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) (>= (+ (* (- 1) ULTIMATE.start_f_~k~0) 1073741823) 0) (or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_f_~z~0) 2147483645)) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:29:01,773 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:29:01,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:01,795 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:29:01,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:01,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:01,807 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:29:01,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 01:29:01,971 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 49 states and 76 transitions. Complement of second has 7 states. [2020-07-29 01:29:01,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:01,974 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:01,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:29:01,978 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 01:29:01,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:01,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:01,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:01,984 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:01,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:01,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:01,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 76 transitions. [2020-07-29 01:29:01,987 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2020-07-29 01:29:01,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:01,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:01,990 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 01:29:01,993 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2020-07-29 01:29:01,995 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:29:01,995 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:01,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:29:01,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:01,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 76 transitions. cyclomatic complexity: 36 [2020-07-29 01:29:02,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 11 examples of accepted words. [2020-07-29 01:29:02,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:02,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:02,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:29:02,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:29:02,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:29:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:02,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:29:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:02,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:02,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:02,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:02,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:02,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:02,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:02,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:02,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:02,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:02,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:29:02,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:02,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:02,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:02,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:02,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:02,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:02,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:02,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:02,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:02,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:02,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:02,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:02,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:02,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:02,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:02,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:02,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:02,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 76 transitions. cyclomatic complexity: 36 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:02,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,041 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2020-07-29 01:29:02,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:02,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:29:02,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 50 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:02,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:02,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 76 transitions. cyclomatic complexity: 36 [2020-07-29 01:29:02,056 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 11 [2020-07-29 01:29:02,062 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 20 states and 28 transitions. [2020-07-29 01:29:02,064 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:29:02,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:29:02,065 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 28 transitions. [2020-07-29 01:29:02,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:02,066 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 28 transitions. [2020-07-29 01:29:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 28 transitions. [2020-07-29 01:29:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2020-07-29 01:29:02,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:02,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 28 transitions. Second operand 13 states. [2020-07-29 01:29:02,102 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 28 transitions. Second operand 13 states. [2020-07-29 01:29:02,105 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 13 states. [2020-07-29 01:29:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:02,111 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 01:29:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-29 01:29:02,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:02,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:02,114 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 20 states and 28 transitions. [2020-07-29 01:29:02,114 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 20 states and 28 transitions. [2020-07-29 01:29:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:02,119 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-29 01:29:02,119 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2020-07-29 01:29:02,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:02,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:02,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:02,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:02,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:29:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2020-07-29 01:29:02,127 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:29:02,128 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:29:02,128 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:29:02,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:29:02,131 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2020-07-29 01:29:02,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:02,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:02,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:29:02,132 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:29:02,133 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 130#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 135#L18-1 assume !(f_~k~0 > 1073741823); 136#L23-3 [2020-07-29 01:29:02,133 INFO L796 eck$LassoCheckResult]: Loop: 136#L23-3 assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; 136#L23-3 [2020-07-29 01:29:02,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:02,134 INFO L82 PathProgramCache]: Analyzing trace with hash 32101, now seen corresponding path program 1 times [2020-07-29 01:29:02,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:02,135 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700049512] [2020-07-29 01:29:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:02,144 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:02,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:02,157 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash 87, now seen corresponding path program 1 times [2020-07-29 01:29:02,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:02,161 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089167548] [2020-07-29 01:29:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:02,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:02,179 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:02,181 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 995187, now seen corresponding path program 1 times [2020-07-29 01:29:02,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:02,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121572585] [2020-07-29 01:29:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:02,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:02,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:02,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:02,268 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:02,269 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:02,269 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:02,269 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:02,269 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:02,270 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,270 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:02,270 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:02,271 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration2_Lasso [2020-07-29 01:29:02,271 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:02,271 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:02,282 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:29:02,292 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:29:02,296 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:29:02,300 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:29:02,306 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:29:02,318 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:29:02,323 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:29:02,328 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:29:02,333 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:29:02,337 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:29:02,342 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:29:02,608 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:02,608 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:02,620 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,620 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,627 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,627 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:02,671 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,671 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} 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) [2020-07-29 01:29:02,711 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,711 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,716 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,716 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:29:02,760 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,761 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:02,765 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,765 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:29:02,811 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:02,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,818 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~d=0, ULTIMATE.start_f_#in~d=0} Honda state: {ULTIMATE.start_f_~d=2, ULTIMATE.start_f_#in~d=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:29:02,854 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,854 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,858 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,858 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:02,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:02,884 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,884 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_~y~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:02,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,908 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,912 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,912 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:02,942 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,942 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:02,967 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:02,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:02,974 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:02,974 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:29:03,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:03,000 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:03,029 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:03,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:15,188 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-29 01:29:15,194 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:15,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:15,194 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:15,194 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:15,195 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:15,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:15,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:15,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration2_Lasso [2020-07-29 01:29:15,195 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:15,195 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:15,204 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:29:15,208 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:29:15,212 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:29:15,223 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:29:15,227 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:29:15,231 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:29:15,235 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:29:15,242 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:29:15,246 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:29:15,253 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:29:15,257 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:29:15,461 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:15,461 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:15,467 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:15,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:15,471 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:15,472 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,505 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:29:15,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:15,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,506 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,506 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:15,507 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:15,511 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 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,534 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:29:15,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:15,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:15,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:15,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:15,541 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:15,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:15,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:15,569 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:15,569 INFO L444 ModelExtractionUtils]: 4 out of 10 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,572 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:15,578 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:15,578 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:15,578 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~z~0, ULTIMATE.start_f_~k~0) = -1*ULTIMATE.start_f_~z~0 + 1*ULTIMATE.start_f_~k~0 Supporting invariants [1*ULTIMATE.start_f_~z~0 - 1 >= 0] [2020-07-29 01:29:15,615 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:15,623 INFO L393 LassoCheck]: Loop: "assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0;" [2020-07-29 01:29:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:15,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:15,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:15,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:29:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:15,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:15,682 INFO L280 TraceCheckUtils]: 0: Hoare triple {188#unseeded} havoc main_#res;havoc main_#t~nondet5; {188#unseeded} is VALID [2020-07-29 01:29:15,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {188#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {207#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:29:15,684 INFO L280 TraceCheckUtils]: 2: Hoare triple {207#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {207#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) unseeded)} is VALID [2020-07-29 01:29:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:15,688 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:15,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:15,693 INFO L280 TraceCheckUtils]: 0: Hoare triple {208#(and (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0) (>= oldRank0 (+ (* (- 1) ULTIMATE.start_f_~z~0) ULTIMATE.start_f_~k~0)))} assume !!(f_~z~0 < f_~k~0);f_~z~0 := 2 * f_~z~0; {210#(and (or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_f_~z~0) ULTIMATE.start_f_~k~0)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_f_~z~0 (- 1)) 0))} is VALID [2020-07-29 01:29:15,694 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:29:15,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:29:15,702 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:29:15,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,702 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2020-07-29 01:29:15,702 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 10 Second operand 3 states. [2020-07-29 01:29:15,795 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 24 states and 35 transitions. Complement of second has 6 states. [2020-07-29 01:29:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:15,795 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:15,795 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 10 [2020-07-29 01:29:15,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:15,796 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:15,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:29:15,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:15,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:15,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:15,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:29:15,799 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2020-07-29 01:29:15,799 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:15,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:15,800 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 10 [2020-07-29 01:29:15,801 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:29:15,802 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:29:15,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:29:15,803 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:15,804 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 35 transitions. cyclomatic complexity: 18 [2020-07-29 01:29:15,806 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 10 examples of accepted words. [2020-07-29 01:29:15,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:15,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:15,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:15,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:15,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:15,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:15,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:15,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:15,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:15,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:15,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:15,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:15,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:15,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:15,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:15,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:15,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:15,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:15,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:15,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:15,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:29:15,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:15,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:15,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:15,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:15,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:15,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:15,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:15,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:15,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:15,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:15,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:15,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:15,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:15,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:15,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:15,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:15,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:15,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:15,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:15,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:15,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:15,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:15,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:15,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,836 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:29:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:29:15,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:29:15,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:29:15,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:29:15,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:15,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. cyclomatic complexity: 18 [2020-07-29 01:29:15,841 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2020-07-29 01:29:15,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 30 transitions. [2020-07-29 01:29:15,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:29:15,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:29:15,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-07-29 01:29:15,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:15,844 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-07-29 01:29:15,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-07-29 01:29:15,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2020-07-29 01:29:15,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:15,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 30 transitions. Second operand 14 states. [2020-07-29 01:29:15,846 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 30 transitions. Second operand 14 states. [2020-07-29 01:29:15,846 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 14 states. [2020-07-29 01:29:15,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:15,848 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-07-29 01:29:15,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:29:15,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:15,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:15,849 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 21 states and 30 transitions. [2020-07-29 01:29:15,849 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 21 states and 30 transitions. [2020-07-29 01:29:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:29:15,851 INFO L93 Difference]: Finished difference Result 21 states and 30 transitions. [2020-07-29 01:29:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2020-07-29 01:29:15,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:15,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:15,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:15,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:15,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:29:15,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2020-07-29 01:29:15,854 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-29 01:29:15,854 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-29 01:29:15,854 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:15,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:29:15,855 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:15,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:15,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:15,856 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:29:15,856 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:15,856 INFO L794 eck$LassoCheckResult]: Stem: 259#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 260#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 267#L18 assume !(f_~k~0 > 1073741823); 263#L23-1 assume !(f_~z~0 < f_~k~0); 261#L29-2 [2020-07-29 01:29:15,857 INFO L796 eck$LassoCheckResult]: Loop: 261#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 262#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 261#L29-2 [2020-07-29 01:29:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 957451, now seen corresponding path program 1 times [2020-07-29 01:29:15,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:15,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628984153] [2020-07-29 01:29:15,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:15,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:15,865 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:15,866 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:15,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:15,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 1 times [2020-07-29 01:29:15,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:15,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393490101] [2020-07-29 01:29:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:15,871 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:15,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:15,874 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:15,875 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:15,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:15,876 INFO L82 PathProgramCache]: Analyzing trace with hash 920111346, now seen corresponding path program 1 times [2020-07-29 01:29:15,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:15,876 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62514121] [2020-07-29 01:29:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:15,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:15,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:15,891 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:15,956 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:15,956 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:15,956 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:15,956 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:15,957 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:15,957 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:15,957 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:15,957 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:15,957 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration3_Lasso [2020-07-29 01:29:15,957 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:15,957 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:15,968 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:29:15,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:29:15,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:29:15,988 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:29:15,992 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:29:15,996 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:29:16,000 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:29:16,013 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:29:16,019 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:29:16,023 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:29:16,242 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:16,242 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,246 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,249 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:16,250 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,284 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,287 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:16,287 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:16,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:16,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~k~0=-14, ULTIMATE.start_f_~z~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,347 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:16,350 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:16,350 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,378 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:16,381 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,403 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,407 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:16,407 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:16,441 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,484 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:16,484 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:16,556 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:16,558 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:16,558 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:16,558 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:16,558 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:16,559 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:16,559 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,559 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:16,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:16,559 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration3_Lasso [2020-07-29 01:29:16,559 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:16,559 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:16,568 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:29:16,571 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:29:16,582 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:29:16,584 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:29:16,601 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:29:16,605 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:29:16,608 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:29:16,613 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:29:16,617 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:29:16,620 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:29:16,817 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:16,817 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,830 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:29:16,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,835 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,876 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:29:16,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,887 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:16,924 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:29:16,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:16,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:16,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,955 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:29:16,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:16,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:16,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:16,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:16,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:16,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:16,974 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:16,987 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:29:16,987 INFO L444 ModelExtractionUtils]: 3 out of 13 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:16,990 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:16,993 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:16,993 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:16,993 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2020-07-29 01:29:17,017 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:17,020 INFO L393 LassoCheck]: Loop: "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d;" [2020-07-29 01:29:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:17,097 INFO L280 TraceCheckUtils]: 0: Hoare triple {321#unseeded} havoc main_#res;havoc main_#t~nondet5; {321#unseeded} is VALID [2020-07-29 01:29:17,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {321#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {340#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:17,099 INFO L280 TraceCheckUtils]: 2: Hoare triple {340#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~k~0 > 1073741823); {340#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:17,100 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~z~0 < f_~k~0); {340#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,105 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:17,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:17,136 INFO L280 TraceCheckUtils]: 0: Hoare triple {341#(and (>= oldRank0 ULTIMATE.start_f_~y~0) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {358#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:17,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {358#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {343#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:17,137 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:29:17,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:17,145 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:29:17,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,146 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:17,146 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 11 Second operand 4 states. [2020-07-29 01:29:17,245 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 20 states and 29 transitions. Complement of second has 6 states. [2020-07-29 01:29:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:17,246 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:17,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:17,246 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,246 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:17,248 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:17,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,248 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,248 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 29 transitions. [2020-07-29 01:29:17,249 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:17,249 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,250 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 11 [2020-07-29 01:29:17,251 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:17,251 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:17,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:17,253 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:17,253 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 29 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:17,254 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:17,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:17,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:17,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:17,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:29:17,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:29:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:29:17,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:29:17,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:29:17,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:29:17,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:17,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:17,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:17,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:17,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:17,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:17,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:17,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:17,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:17,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:17,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:17,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:17,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:17,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:17,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 29 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:17,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,280 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:29:17,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:17,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:17,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:17,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 29 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:17,284 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:17,285 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 28 transitions. [2020-07-29 01:29:17,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:29:17,286 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:29:17,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2020-07-29 01:29:17,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:17,287 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2020-07-29 01:29:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2020-07-29 01:29:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2020-07-29 01:29:17,290 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:17,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 28 transitions. Second operand 18 states. [2020-07-29 01:29:17,290 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 28 transitions. Second operand 18 states. [2020-07-29 01:29:17,290 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 18 states. [2020-07-29 01:29:17,291 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:17,294 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-07-29 01:29:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2020-07-29 01:29:17,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:17,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:17,295 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 19 states and 28 transitions. [2020-07-29 01:29:17,295 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 19 states and 28 transitions. [2020-07-29 01:29:17,296 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:17,298 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2020-07-29 01:29:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2020-07-29 01:29:17,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:17,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:17,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:17,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:29:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-07-29 01:29:17,301 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:29:17,301 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:29:17,301 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:17,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2020-07-29 01:29:17,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:17,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:17,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:17,303 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:29:17,303 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:17,304 INFO L794 eck$LassoCheckResult]: Stem: 395#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 396#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 405#L18-1 assume !(f_~k~0 > 1073741823); 406#L23-3 assume !(f_~z~0 < f_~k~0); 394#L29-5 [2020-07-29 01:29:17,304 INFO L796 eck$LassoCheckResult]: Loop: 394#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 392#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 394#L29-5 [2020-07-29 01:29:17,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,304 INFO L82 PathProgramCache]: Analyzing trace with hash 995185, now seen corresponding path program 1 times [2020-07-29 01:29:17,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:17,305 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533978466] [2020-07-29 01:29:17,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,310 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,313 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,314 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:17,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 1 times [2020-07-29 01:29:17,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:17,316 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017891235] [2020-07-29 01:29:17,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,319 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,322 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash 956374936, now seen corresponding path program 1 times [2020-07-29 01:29:17,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:17,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771458535] [2020-07-29 01:29:17,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,330 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:17,334 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:17,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:17,435 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:17,436 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:17,436 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:17,436 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:17,436 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:17,436 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,436 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:17,436 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:17,436 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration4_Lasso [2020-07-29 01:29:17,436 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:17,436 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:17,444 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:29:17,448 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:29:17,451 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:29:17,454 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:29:17,458 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:29:17,466 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:29:17,476 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:29:17,481 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:29:17,484 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:29:17,490 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:29:17,659 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:17,659 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:17,662 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:17,662 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,666 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:17,666 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:17,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:17,702 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,706 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:17,706 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:17,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:17,742 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,745 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:17,745 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,768 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:17,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:17,771 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:17,771 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:17,795 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:17,798 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:17,798 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=1, ULTIMATE.start_f_~k~0=-14} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:17,822 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:17,849 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:17,923 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:17,924 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:17,924 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:17,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:17,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:17,924 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:17,925 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:17,925 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:17,925 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:17,925 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration4_Lasso [2020-07-29 01:29:17,925 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:17,925 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:17,938 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:29:17,945 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:29:17,948 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:29:17,951 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:29:17,961 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:29:17,964 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:29:17,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:29:17,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:29:17,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:29:17,977 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:29:18,164 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:18,164 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,168 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:29:18,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:18,170 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:18,170 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:18,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:18,171 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:18,171 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:18,176 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,199 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:29:18,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:18,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:18,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:18,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:18,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:18,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:18,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:18,202 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,236 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:29:18,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:18,238 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:18,238 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:18,238 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:18,238 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:18,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:18,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:18,240 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,263 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:29:18,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:18,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:18,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:18,264 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:18,267 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:18,267 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:18,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:18,288 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:29:18,289 INFO L444 ModelExtractionUtils]: 7 out of 13 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:18,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,294 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:18,295 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:18,295 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2020-07-29 01:29:18,322 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:18,327 INFO L393 LassoCheck]: Loop: "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d;" [2020-07-29 01:29:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:18,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:18,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:18,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:18,414 INFO L280 TraceCheckUtils]: 0: Hoare triple {516#unseeded} havoc main_#res;havoc main_#t~nondet5; {516#unseeded} is VALID [2020-07-29 01:29:18,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {516#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {535#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:18,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {535#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {535#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:18,416 INFO L280 TraceCheckUtils]: 3: Hoare triple {535#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~z~0 < f_~k~0); {535#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:18,420 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:18,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:18,457 INFO L280 TraceCheckUtils]: 0: Hoare triple {536#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) (>= oldRank0 ULTIMATE.start_f_~y~0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {553#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:18,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {553#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {538#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 2)) 0))} is VALID [2020-07-29 01:29:18,458 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:29:18,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:18,472 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:29:18,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,472 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:18,472 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14 Second operand 4 states. [2020-07-29 01:29:18,544 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 24 states and 35 transitions. Complement of second has 6 states. [2020-07-29 01:29:18,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:18,544 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:18,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:18,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:18,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:18,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:18,545 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:18,545 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:18,545 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:18,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 35 transitions. [2020-07-29 01:29:18,546 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:18,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:18,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:18,547 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 27 transitions. cyclomatic complexity: 14 [2020-07-29 01:29:18,547 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:18,548 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:18,548 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:18,549 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:18,549 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:18,549 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:18,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:18,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:18,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:18,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:18,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:29:18,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,553 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:29:18,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:18,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:18,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,554 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:29:18,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:18,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:18,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:18,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:29:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:18,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:18,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:18,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:18,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:18,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:18,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:18,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:18,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 35 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:18,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,571 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:18,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:18,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:29:18,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:29:18,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:29:18,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:18,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:18,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:18,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:18,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 34 transitions. [2020-07-29 01:29:18,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:29:18,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:29:18,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2020-07-29 01:29:18,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:18,576 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2020-07-29 01:29:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2020-07-29 01:29:18,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-29 01:29:18,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:18,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 34 transitions. Second operand 22 states. [2020-07-29 01:29:18,579 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 34 transitions. Second operand 22 states. [2020-07-29 01:29:18,579 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand 22 states. [2020-07-29 01:29:18,579 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:18,581 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2020-07-29 01:29:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2020-07-29 01:29:18,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:18,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:18,582 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states and 34 transitions. [2020-07-29 01:29:18,582 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states and 34 transitions. [2020-07-29 01:29:18,583 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:18,585 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2020-07-29 01:29:18,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2020-07-29 01:29:18,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:18,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:18,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:18,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 01:29:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 33 transitions. [2020-07-29 01:29:18,587 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-29 01:29:18,587 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-29 01:29:18,587 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:29:18,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. [2020-07-29 01:29:18,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:29:18,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:18,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:18,589 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:29:18,589 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:18,589 INFO L794 eck$LassoCheckResult]: Stem: 595#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 596#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 607#L18 assume !(f_~k~0 > 1073741823); 602#L23-1 assume !(f_~z~0 < f_~k~0); 603#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 601#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 609#L30 [2020-07-29 01:29:18,590 INFO L796 eck$LassoCheckResult]: Loop: 609#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 597#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 598#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 609#L30 [2020-07-29 01:29:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:18,590 INFO L82 PathProgramCache]: Analyzing trace with hash 920111342, now seen corresponding path program 1 times [2020-07-29 01:29:18,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:18,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642542602] [2020-07-29 01:29:18,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:18,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:18,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:18,600 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:18,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash 63396, now seen corresponding path program 1 times [2020-07-29 01:29:18,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:18,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593476036] [2020-07-29 01:29:18,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:18,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:18,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:18,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:18,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash 555740055, now seen corresponding path program 1 times [2020-07-29 01:29:18,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:18,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668032239] [2020-07-29 01:29:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:18,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:18,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:18,626 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:18,653 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:18,653 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:18,653 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:18,653 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:18,653 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:18,653 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,653 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:18,653 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:18,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration5_Loop [2020-07-29 01:29:18,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:18,654 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:18,658 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:29:18,663 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:29:18,669 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:29:18,673 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:29:18,781 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:18,781 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:18,784 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:18,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:18,815 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,828 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:18,828 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=-1}, {ULTIMATE.start_f_~z~0=-2}, {ULTIMATE.start_f_~z~0=2}] Lambdas: [1, 2, 1] Nus: [0, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:18,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:18,855 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:18,855 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=2, ULTIMATE.start_f_~y~0=2} Honda state: {ULTIMATE.start_f_#t~nondet4=2, ULTIMATE.start_f_~y~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:18,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:18,880 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:18,880 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=7} Honda state: {ULTIMATE.start_f_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:18,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:18,905 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:18,905 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-07-29 01:29:18,984 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:18,985 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:18,985 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:18,985 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:18,985 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:18,985 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:18,985 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:18,985 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:18,985 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration5_Lasso [2020-07-29 01:29:18,985 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:18,985 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:18,997 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:29:19,003 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:29:19,006 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:29:19,010 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:29:19,022 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:29:19,026 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:29:19,030 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:29:19,033 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:29:19,037 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:29:19,256 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:19,258 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:19,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:19,262 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,268 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:19,268 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0, ULTIMATE.start_f_~y~0=0} Honda state: {ULTIMATE.start_f_#t~nondet4=4, ULTIMATE.start_f_~y~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:19,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:19,293 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,296 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:19,297 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:19,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:19,322 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:19,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=7} Honda state: {ULTIMATE.start_f_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:19,344 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:19,369 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:19,582 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:19,584 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:19,584 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:19,584 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:19,584 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:19,584 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:19,584 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,584 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:19,584 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:19,585 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration5_Lasso [2020-07-29 01:29:19,585 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:19,585 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:19,594 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:29:19,603 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:29:19,606 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:29:19,618 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:29:19,622 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:29:19,626 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:29:19,629 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:29:19,633 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:29:19,637 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:29:19,847 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:19,847 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:19,849 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:19,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:19,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:19,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:19,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:19,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:19,859 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:19,898 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:29:19,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:19,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:19,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:19,900 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:29:19,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:19,902 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:29:19,902 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:19,948 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:29:19,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:19,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:19,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:19,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:19,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:19,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,962 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:19,968 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:19,969 INFO L444 ModelExtractionUtils]: 7 out of 13 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:19,973 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:19,976 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:19,976 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:19,976 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0, ULTIMATE.start_f_~d) = 1*ULTIMATE.start_f_~x~0 - 1*ULTIMATE.start_f_~d Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2020-07-29 01:29:20,013 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:20,018 INFO L393 LassoCheck]: Loop: "f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1;" "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume 0 != f_#t~nondet3;havoc f_#t~nondet3;" [2020-07-29 01:29:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:20,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:20,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:20,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#unseeded} havoc main_#res;havoc main_#t~nondet5; {733#unseeded} is VALID [2020-07-29 01:29:20,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:20,095 INFO L280 TraceCheckUtils]: 2: Hoare triple {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~k~0 > 1073741823); {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:20,096 INFO L280 TraceCheckUtils]: 3: Hoare triple {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~z~0 < f_~k~0); {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:20,097 INFO L280 TraceCheckUtils]: 4: Hoare triple {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:20,097 INFO L280 TraceCheckUtils]: 5: Hoare triple {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {752#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:20,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:20,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:20,194 INFO L280 TraceCheckUtils]: 0: Hoare triple {753#(and (>= oldRank0 (+ ULTIMATE.start_f_~x~0 (* (- 1) ULTIMATE.start_f_~d))) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {776#(and (<= ULTIMATE.start_f_~x~0 oldRank0) (<= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:29:20,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {776#(and (<= ULTIMATE.start_f_~x~0 oldRank0) (<= 1 ULTIMATE.start_f_~d))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {780#(and (<= ULTIMATE.start_f_~x~0 oldRank0) (< 0 ULTIMATE.start_f_~x~0) (<= 1 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:29:20,197 INFO L280 TraceCheckUtils]: 2: Hoare triple {780#(and (<= ULTIMATE.start_f_~x~0 oldRank0) (< 0 ULTIMATE.start_f_~x~0) (<= 1 ULTIMATE.start_f_~d))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {755#(and (or (and (>= oldRank0 0) (> oldRank0 (+ ULTIMATE.start_f_~x~0 (* (- 1) ULTIMATE.start_f_~d)))) unseeded) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:20,197 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:29:20,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:20,207 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:20,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:29:20,208 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-07-29 01:29:20,297 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 33 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 32 states and 46 transitions. Complement of second has 7 states. [2020-07-29 01:29:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:20,297 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:20,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 33 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:20,298 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:20,298 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:20,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:20,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:20,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:20,300 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:20,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 46 transitions. [2020-07-29 01:29:20,301 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:29:20,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:20,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:20,302 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 33 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:20,302 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:29:20,303 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:20,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:20,304 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:20,304 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 46 transitions. cyclomatic complexity: 21 [2020-07-29 01:29:20,305 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:20,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:20,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:20,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:20,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:20,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:20,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:20,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:29:20,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:29:20,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 22 letters. Loop has 22 letters. [2020-07-29 01:29:20,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:20,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:20,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:20,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:20,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 33 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:20,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 46 transitions. cyclomatic complexity: 21 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:20,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,324 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:29:20,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:20,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:20,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:20,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:20,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 46 transitions. cyclomatic complexity: 21 [2020-07-29 01:29:20,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:29:20,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 28 states and 41 transitions. [2020-07-29 01:29:20,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:29:20,329 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:29:20,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 41 transitions. [2020-07-29 01:29:20,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:20,330 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 41 transitions. [2020-07-29 01:29:20,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 41 transitions. [2020-07-29 01:29:20,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-29 01:29:20,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:20,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states and 41 transitions. Second operand 27 states. [2020-07-29 01:29:20,333 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states and 41 transitions. Second operand 27 states. [2020-07-29 01:29:20,333 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 27 states. [2020-07-29 01:29:20,334 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:20,336 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2020-07-29 01:29:20,336 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2020-07-29 01:29:20,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:20,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:20,337 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states and 41 transitions. [2020-07-29 01:29:20,337 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states and 41 transitions. [2020-07-29 01:29:20,338 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:20,340 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2020-07-29 01:29:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2020-07-29 01:29:20,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:20,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:20,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:20,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-29 01:29:20,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2020-07-29 01:29:20,343 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-07-29 01:29:20,344 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 40 transitions. [2020-07-29 01:29:20,344 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:29:20,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. [2020-07-29 01:29:20,345 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:29:20,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:20,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:20,345 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:29:20,345 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:20,346 INFO L794 eck$LassoCheckResult]: Stem: 832#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 833#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 841#L18-1 assume !(f_~k~0 > 1073741823); 842#L23-3 assume !(f_~z~0 < f_~k~0); 850#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 828#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 829#L30-1 [2020-07-29 01:29:20,346 INFO L796 eck$LassoCheckResult]: Loop: 829#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 846#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 847#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 829#L30-1 [2020-07-29 01:29:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,347 INFO L82 PathProgramCache]: Analyzing trace with hash 956374932, now seen corresponding path program 1 times [2020-07-29 01:29:20,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:20,347 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19003451] [2020-07-29 01:29:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:20,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,356 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash 101130, now seen corresponding path program 1 times [2020-07-29 01:29:20,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:20,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567018739] [2020-07-29 01:29:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,362 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,366 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1447371113, now seen corresponding path program 1 times [2020-07-29 01:29:20,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:20,367 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926681602] [2020-07-29 01:29:20,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:20,382 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:20,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:20,420 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:20,420 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:20,420 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:20,420 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:20,420 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:20,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:20,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:20,439 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration6_Loop [2020-07-29 01:29:20,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:20,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:20,456 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:29:20,478 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:29:20,496 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:29:20,502 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:29:20,600 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:20,601 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,603 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:20,603 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:20,606 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:20,606 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=7} Honda state: {ULTIMATE.start_f_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:20,630 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:20,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:20,666 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:20,666 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=-7}, {ULTIMATE.start_f_~z~0=-1}, {ULTIMATE.start_f_~z~0=7}] Lambdas: [1, 8, 1] Nus: [0, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,691 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:20,691 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:20,694 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:20,694 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Honda state: {ULTIMATE.start_f_~x~0=1, ULTIMATE.start_f_~d=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:20,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:20,722 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:20,722 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=2, ULTIMATE.start_f_~y~0=2} Honda state: {ULTIMATE.start_f_#t~nondet4=2, ULTIMATE.start_f_~y~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2020-07-29 01:29:20,792 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:20,792 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:20,792 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:20,792 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:20,792 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:20,792 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:20,793 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:20,793 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:20,793 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration6_Lasso [2020-07-29 01:29:20,793 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:20,793 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:20,802 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:29:20,810 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:29:20,818 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:29:20,822 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:29:20,825 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:29:20,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:29:20,830 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:29:20,835 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:29:20,838 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:29:21,053 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:21,053 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,056 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:21,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,097 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,097 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=1, ULTIMATE.start_f_~k~0=-11} Generalized eigenvectors: [{ULTIMATE.start_f_~z~0=3, ULTIMATE.start_f_~k~0=-7}, {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0}, {ULTIMATE.start_f_~z~0=-4, ULTIMATE.start_f_~k~0=7}] Lambdas: [1, 15, 1] Nus: [0, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,119 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,119 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,122 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,123 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~y~0=0, ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_~y~0=4, ULTIMATE.start_f_#t~nondet4=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,147 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,148 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,169 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,172 INFO L437 LassoAnalysis]: Proved nontermination for one component. Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,173 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,196 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,196 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,198 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,198 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,223 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,223 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,244 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,248 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,248 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=7} Honda state: {ULTIMATE.start_f_#t~nondet3=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:21,271 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:21,271 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:21,293 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:21,319 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,512 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:21,514 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:21,514 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:21,514 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:21,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:21,514 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:21,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,515 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:21,515 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:21,515 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration6_Lasso [2020-07-29 01:29:21,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:21,515 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:21,525 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:29:21,539 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:29:21,546 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:29:21,558 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:29:21,566 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:29:21,570 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:29:21,575 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:29:21,584 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:29:21,587 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:29:21,788 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:21,788 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,801 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:29:21,803 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:21,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:21,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:21,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:21,806 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:21,806 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:21,814 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:21,822 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:21,822 INFO L444 ModelExtractionUtils]: 7 out of 13 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:21,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:21,831 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-07-29 01:29:21,831 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:21,831 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~x~0) = 1*ULTIMATE.start_f_~x~0 + 1 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0, 1*ULTIMATE.start_f_~x~0 >= 0] [2020-07-29 01:29:21,865 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2020-07-29 01:29:21,868 INFO L393 LassoCheck]: Loop: "f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1;" "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume 0 != f_#t~nondet3;havoc f_#t~nondet3;" [2020-07-29 01:29:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:21,935 INFO L280 TraceCheckUtils]: 0: Hoare triple {992#unseeded} havoc main_#res;havoc main_#t~nondet5; {992#unseeded} is VALID [2020-07-29 01:29:21,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {992#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:21,936 INFO L280 TraceCheckUtils]: 2: Hoare triple {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:21,937 INFO L280 TraceCheckUtils]: 3: Hoare triple {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~z~0 < f_~k~0); {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:21,938 INFO L280 TraceCheckUtils]: 4: Hoare triple {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:21,939 INFO L280 TraceCheckUtils]: 5: Hoare triple {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {1016#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:21,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:22,016 INFO L280 TraceCheckUtils]: 0: Hoare triple {1017#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) (>= oldRank0 (+ ULTIMATE.start_f_~x~0 1)))} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {1040#(and (<= (+ ULTIMATE.start_f_~x~0 ULTIMATE.start_f_~d 1) oldRank0) (<= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:29:22,017 INFO L280 TraceCheckUtils]: 1: Hoare triple {1040#(and (<= (+ ULTIMATE.start_f_~x~0 ULTIMATE.start_f_~d 1) oldRank0) (<= 2 ULTIMATE.start_f_~d))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1044#(and (<= (+ ULTIMATE.start_f_~x~0 ULTIMATE.start_f_~d 1) oldRank0) (< 0 ULTIMATE.start_f_~x~0) (<= 2 ULTIMATE.start_f_~d))} is VALID [2020-07-29 01:29:22,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {1044#(and (<= (+ ULTIMATE.start_f_~x~0 ULTIMATE.start_f_~d 1) oldRank0) (< 0 ULTIMATE.start_f_~x~0) (<= 2 ULTIMATE.start_f_~d))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {1019#(and (or (and (> oldRank0 (+ ULTIMATE.start_f_~x~0 1)) (>= oldRank0 0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 2)) 0))} is VALID [2020-07-29 01:29:22,019 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:29:22,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:22,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:22,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,031 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:29:22,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-07-29 01:29:22,128 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 40 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 37 states and 53 transitions. Complement of second has 7 states. [2020-07-29 01:29:22,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:22,129 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:22,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 40 transitions. cyclomatic complexity: 20 [2020-07-29 01:29:22,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:22,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:22,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 53 transitions. [2020-07-29 01:29:22,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:22,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 40 transitions. cyclomatic complexity: 20 [2020-07-29 01:29:22,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:22,133 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:22,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:22,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:22,134 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 53 transitions. cyclomatic complexity: 24 [2020-07-29 01:29:22,135 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:22,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:22,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:22,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:22,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:29:22,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:29:22,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:29:22,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:22,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:22,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:29:22,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:22,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:22,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:22,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:22,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:22,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:29:22,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:22,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:22,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:29:22,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:22,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:22,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:22,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:22,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:22,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:22,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:22,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 40 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 53 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:22,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,154 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:29:22,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:29:22,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:22,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:29:22,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:22,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 53 transitions. cyclomatic complexity: 24 [2020-07-29 01:29:22,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:22,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 48 transitions. [2020-07-29 01:29:22,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:29:22,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:29:22,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2020-07-29 01:29:22,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:22,160 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-07-29 01:29:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2020-07-29 01:29:22,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-29 01:29:22,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:22,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 48 transitions. Second operand 32 states. [2020-07-29 01:29:22,163 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 48 transitions. Second operand 32 states. [2020-07-29 01:29:22,163 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 32 states. [2020-07-29 01:29:22,164 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:22,165 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-07-29 01:29:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2020-07-29 01:29:22,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:22,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:22,167 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states and 48 transitions. [2020-07-29 01:29:22,167 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states and 48 transitions. [2020-07-29 01:29:22,167 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:22,169 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2020-07-29 01:29:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2020-07-29 01:29:22,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:22,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:22,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:22,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-29 01:29:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-07-29 01:29:22,172 INFO L711 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-07-29 01:29:22,172 INFO L591 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-07-29 01:29:22,173 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:29:22,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. [2020-07-29 01:29:22,173 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:22,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:22,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:22,174 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:22,174 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:22,174 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 1102#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1112#L18 assume !(f_~k~0 > 1073741823); 1107#L23-1 assume !(f_~z~0 < f_~k~0); 1108#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1125#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 1120#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1121#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1126#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1103#L29-2 [2020-07-29 01:29:22,175 INFO L796 eck$LassoCheckResult]: Loop: 1103#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1104#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1103#L29-2 [2020-07-29 01:29:22,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,175 INFO L82 PathProgramCache]: Analyzing trace with hash 555740059, now seen corresponding path program 1 times [2020-07-29 01:29:22,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,176 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651505982] [2020-07-29 01:29:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,183 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:22,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 2 times [2020-07-29 01:29:22,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036393115] [2020-07-29 01:29:22,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,198 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,201 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:22,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1490252930, now seen corresponding path program 2 times [2020-07-29 01:29:22,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:22,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676663617] [2020-07-29 01:29:22,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:22,216 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:22,218 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:22,347 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:22,348 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:22,348 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:22,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:22,348 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:22,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:22,349 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:22,349 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration7_Lasso [2020-07-29 01:29:22,349 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:22,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:22,357 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:29:22,364 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:29:22,368 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:29:22,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:29:22,386 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:29:22,391 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:29:22,393 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:29:22,397 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:29:22,400 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:29:22,402 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:29:22,594 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:22,595 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,599 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:22,599 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:22,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:22,603 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=0} Honda state: {ULTIMATE.start_f_~z~0=0, ULTIMATE.start_f_~k~0=-14} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,625 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:22,625 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:22,628 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:22,628 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:22,650 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:22,675 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:22,675 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,750 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:22,752 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:22,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:22,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:22,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:22,752 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:22,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:22,753 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:22,753 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration7_Lasso [2020-07-29 01:29:22,753 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:22,753 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:22,762 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:29:22,766 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:29:22,769 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:29:22,774 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:29:22,778 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:29:22,781 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:29:22,788 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:29:22,790 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:29:22,794 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:29:22,807 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:29:22,993 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:22,993 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:22,996 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:29:22,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:22,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:22,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:22,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:23,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:23,004 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,025 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:29:23,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:23,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,026 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,026 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:23,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:23,028 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,050 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:29:23,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:23,051 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,051 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:23,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:23,053 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 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,077 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:29:23,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:23,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,080 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:23,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:23,082 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 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,106 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:29:23,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,108 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:23,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,108 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:23,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:23,111 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 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,135 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:29:23,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,138 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:23,138 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:23,142 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 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,165 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:29:23,166 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:23,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,167 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:23,167 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:23,168 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:23,189 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:29:23,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:23,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:23,191 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:23,193 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:23,194 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 101 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:23,223 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:29:23,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:23,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:23,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:23,227 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:23,227 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:23,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:23,257 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-29 01:29:23,257 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,259 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:23,261 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:23,261 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:23,262 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2020-07-29 01:29:23,284 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:23,287 INFO L393 LassoCheck]: Loop: "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d;" [2020-07-29 01:29:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:23,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {1282#unseeded} havoc main_#res;havoc main_#t~nondet5; {1282#unseeded} is VALID [2020-07-29 01:29:23,361 INFO L280 TraceCheckUtils]: 1: Hoare triple {1282#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,361 INFO L280 TraceCheckUtils]: 2: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~k~0 > 1073741823); {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,362 INFO L280 TraceCheckUtils]: 3: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~z~0 < f_~k~0); {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,362 INFO L280 TraceCheckUtils]: 4: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,363 INFO L280 TraceCheckUtils]: 5: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,364 INFO L280 TraceCheckUtils]: 6: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,364 INFO L280 TraceCheckUtils]: 7: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,365 INFO L280 TraceCheckUtils]: 8: Hoare triple {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {1301#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,371 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:23,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:23,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {1302#(and (>= oldRank0 ULTIMATE.start_f_~y~0) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1334#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:23,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {1334#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {1304#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:23,410 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:29:23,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:23,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:23,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,419 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:23,419 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 23 Second operand 4 states. [2020-07-29 01:29:23,498 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 47 transitions. cyclomatic complexity: 23. Second operand 4 states. Result 50 states and 69 transitions. Complement of second has 6 states. [2020-07-29 01:29:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:23,498 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:23,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 47 transitions. cyclomatic complexity: 23 [2020-07-29 01:29:23,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:23,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:23,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:23,499 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:23,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:23,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:23,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 69 transitions. [2020-07-29 01:29:23,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:23,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:23,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:23,501 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 47 transitions. cyclomatic complexity: 23 [2020-07-29 01:29:23,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:23,502 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:23,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:23,503 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:23,503 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 69 transitions. cyclomatic complexity: 30 [2020-07-29 01:29:23,504 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:23,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:23,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:23,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:23,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:29:23,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:29:23,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 50 letters. [2020-07-29 01:29:23,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:23,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:23,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 32 letters. [2020-07-29 01:29:23,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:23,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:23,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:23,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:23,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:23,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:23,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:23,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:23,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:23,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:23,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 47 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:23,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:23,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 69 transitions. cyclomatic complexity: 30 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:23,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,520 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:29:23,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:23,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:23,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:29:23,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:23,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 69 transitions. cyclomatic complexity: 30 [2020-07-29 01:29:23,524 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:23,525 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 59 transitions. [2020-07-29 01:29:23,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-29 01:29:23,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:29:23,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 59 transitions. [2020-07-29 01:29:23,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:23,526 INFO L688 BuchiCegarLoop]: Abstraction has 42 states and 59 transitions. [2020-07-29 01:29:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 59 transitions. [2020-07-29 01:29:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-07-29 01:29:23,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:23,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states and 59 transitions. Second operand 40 states. [2020-07-29 01:29:23,530 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states and 59 transitions. Second operand 40 states. [2020-07-29 01:29:23,530 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 40 states. [2020-07-29 01:29:23,530 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:23,532 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2020-07-29 01:29:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2020-07-29 01:29:23,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:23,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:23,533 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 42 states and 59 transitions. [2020-07-29 01:29:23,533 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 42 states and 59 transitions. [2020-07-29 01:29:23,534 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:23,536 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2020-07-29 01:29:23,536 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2020-07-29 01:29:23,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:23,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:23,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:23,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-29 01:29:23,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 57 transitions. [2020-07-29 01:29:23,538 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2020-07-29 01:29:23,538 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 57 transitions. [2020-07-29 01:29:23,538 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:29:23,539 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. [2020-07-29 01:29:23,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:23,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:23,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:23,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:23,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:23,540 INFO L794 eck$LassoCheckResult]: Stem: 1402#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 1403#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1411#L18-1 assume !(f_~k~0 > 1073741823); 1412#L23-3 assume !(f_~z~0 < f_~k~0); 1426#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1428#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 1418#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1419#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1429#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1399#L29-5 [2020-07-29 01:29:23,540 INFO L796 eck$LassoCheckResult]: Loop: 1399#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1398#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1399#L29-5 [2020-07-29 01:29:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1447371109, now seen corresponding path program 1 times [2020-07-29 01:29:23,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:23,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862676931] [2020-07-29 01:29:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,548 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,555 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:23,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,555 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 2 times [2020-07-29 01:29:23,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:23,556 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717116411] [2020-07-29 01:29:23,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,561 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:23,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:23,562 INFO L82 PathProgramCache]: Analyzing trace with hash 645770306, now seen corresponding path program 2 times [2020-07-29 01:29:23,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:23,563 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70164783] [2020-07-29 01:29:23,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:23,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:23,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:23,716 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:23,717 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:23,717 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:23,717 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:23,717 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:23,717 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,717 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:23,718 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:23,718 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration8_Lasso [2020-07-29 01:29:23,718 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:23,718 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:23,726 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:29:23,729 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:29:23,743 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:29:23,748 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:29:23,751 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:29:23,757 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:29:23,761 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:29:23,764 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:29:23,767 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:29:23,770 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:29:23,962 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:23,963 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:23,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:23,973 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:23,973 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:23,994 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:23,995 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,019 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:24,019 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:24,097 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:24,099 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:24,099 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:24,099 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:24,099 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:24,099 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:24,099 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,099 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:24,099 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:24,100 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration8_Lasso [2020-07-29 01:29:24,100 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:24,100 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:24,106 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:29:24,110 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:29:24,123 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:29:24,129 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:29:24,132 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:29:24,138 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:29:24,141 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:29:24,144 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:29:24,147 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:29:24,153 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:29:24,351 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:24,351 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,354 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:29:24,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:24,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:24,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:24,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:24,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:24,355 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:24,356 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:24,357 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 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,388 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:29:24,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:24,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:24,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:24,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:24,392 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:24,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:24,401 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:24,406 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:24,407 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,408 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:24,410 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:24,410 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:24,411 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2020-07-29 01:29:24,434 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:24,437 INFO L393 LassoCheck]: Loop: "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d;" [2020-07-29 01:29:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:24,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:24,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:24,515 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#unseeded} havoc main_#res;havoc main_#t~nondet5; {1622#unseeded} is VALID [2020-07-29 01:29:24,516 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~z~0 < f_~k~0); {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,522 INFO L280 TraceCheckUtils]: 6: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,523 INFO L280 TraceCheckUtils]: 8: Hoare triple {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {1641#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:24,526 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:24,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:24,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {1642#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) (>= oldRank0 ULTIMATE.start_f_~y~0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {1674#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:24,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {1674#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {1644#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 2)) 0))} is VALID [2020-07-29 01:29:24,550 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:29:24,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:24,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:24,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:24,561 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 27 Second operand 4 states. [2020-07-29 01:29:24,637 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 57 transitions. cyclomatic complexity: 27. Second operand 4 states. Result 58 states and 79 transitions. Complement of second has 6 states. [2020-07-29 01:29:24,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:24,637 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:24,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 57 transitions. cyclomatic complexity: 27 [2020-07-29 01:29:24,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:24,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:24,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:24,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:24,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:24,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:24,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 58 states and 79 transitions. [2020-07-29 01:29:24,640 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:24,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:24,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:24,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 40 states and 57 transitions. cyclomatic complexity: 27 [2020-07-29 01:29:24,641 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:24,641 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:24,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:24,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:24,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 58 states and 79 transitions. cyclomatic complexity: 34 [2020-07-29 01:29:24,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:24,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:24,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:24,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:24,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:29:24,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:29:24,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 58 letters. Loop has 58 letters. [2020-07-29 01:29:24,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:29:24,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:29:24,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 40 letters. Loop has 40 letters. [2020-07-29 01:29:24,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:24,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:24,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:24,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:24,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:24,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:29:24,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:24,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:24,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:24,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 40 states and 57 transitions. cyclomatic complexity: 27 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 58 states and 79 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:24,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,659 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:24,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:29:24,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:29:24,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:24,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:29:24,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:24,662 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 79 transitions. cyclomatic complexity: 34 [2020-07-29 01:29:24,664 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:24,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 50 states and 69 transitions. [2020-07-29 01:29:24,666 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 01:29:24,666 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:29:24,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 69 transitions. [2020-07-29 01:29:24,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:24,666 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 69 transitions. [2020-07-29 01:29:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 69 transitions. [2020-07-29 01:29:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2020-07-29 01:29:24,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:24,670 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states and 69 transitions. Second operand 48 states. [2020-07-29 01:29:24,670 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states and 69 transitions. Second operand 48 states. [2020-07-29 01:29:24,670 INFO L87 Difference]: Start difference. First operand 50 states and 69 transitions. Second operand 48 states. [2020-07-29 01:29:24,671 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:24,673 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2020-07-29 01:29:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2020-07-29 01:29:24,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:24,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:24,674 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 50 states and 69 transitions. [2020-07-29 01:29:24,675 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 50 states and 69 transitions. [2020-07-29 01:29:24,675 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:24,677 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2020-07-29 01:29:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2020-07-29 01:29:24,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:24,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:24,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:24,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-29 01:29:24,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 67 transitions. [2020-07-29 01:29:24,680 INFO L711 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2020-07-29 01:29:24,681 INFO L591 BuchiCegarLoop]: Abstraction has 48 states and 67 transitions. [2020-07-29 01:29:24,681 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:29:24,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. [2020-07-29 01:29:24,681 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:24,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:24,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:24,682 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:24,682 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:24,682 INFO L794 eck$LassoCheckResult]: Stem: 1750#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 1751#L41 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 1761#L18 assume !(f_~k~0 > 1073741823); 1757#L23-1 assume !(f_~z~0 < f_~k~0); 1752#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1754#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1785#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1778#L29 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 1779#L30 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 1783#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1782#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1763#L29-2 [2020-07-29 01:29:24,683 INFO L796 eck$LassoCheckResult]: Loop: 1763#L29-2 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 1762#L29 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 1763#L29-2 [2020-07-29 01:29:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:24,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1600239380, now seen corresponding path program 3 times [2020-07-29 01:29:24,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:24,684 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472966818] [2020-07-29 01:29:24,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:24,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:24,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:24,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:24,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1896, now seen corresponding path program 3 times [2020-07-29 01:29:24,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:24,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350700305] [2020-07-29 01:29:24,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:24,702 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:24,704 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:24,705 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:24,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:24,706 INFO L82 PathProgramCache]: Analyzing trace with hash 231753147, now seen corresponding path program 4 times [2020-07-29 01:29:24,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:24,706 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734582529] [2020-07-29 01:29:24,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:24,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:24,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:24,720 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:24,880 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:24,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:24,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:24,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:24,881 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:24,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:24,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:24,881 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:24,881 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration9_Lasso [2020-07-29 01:29:24,881 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:24,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:24,890 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:29:24,899 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:29:24,902 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:29:24,905 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:29:24,908 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:29:24,911 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:29:24,916 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:29:24,919 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:29:24,925 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:29:24,928 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:29:25,122 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:25,123 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:25,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,126 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,133 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,133 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,156 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,156 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,159 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,159 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet0=0} Honda state: {ULTIMATE.start_f_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,183 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,183 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,185 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,185 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet5=0} Honda state: {ULTIMATE.start_main_#t~nondet5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,210 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,210 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet1=0} Honda state: {ULTIMATE.start_f_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,234 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,234 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet2=0} Honda state: {ULTIMATE.start_f_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,258 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,258 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,282 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,308 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~k~0=-14, ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,331 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:25,331 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet4=0} Honda state: {ULTIMATE.start_f_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,353 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:25,353 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:25,378 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:25,461 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:25,463 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:25,463 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:25,463 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:25,463 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:25,463 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:25,463 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,463 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:25,463 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:25,464 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration9_Lasso [2020-07-29 01:29:25,464 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:25,464 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:25,473 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:29:25,476 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:29:25,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:29:25,483 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:29:25,486 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:29:25,489 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:29:25,492 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:29:25,497 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:29:25,500 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:29:25,506 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:29:25,708 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:25,708 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,711 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:29:25,712 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,713 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,714 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,715 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 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,738 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:29:25,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,739 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,743 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:25,766 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,768 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,768 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,769 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,770 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 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,795 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:29:25,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,797 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,797 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,797 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,799 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 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,827 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:29:25,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,829 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,830 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 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,854 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:29:25,856 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,856 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,856 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:25,857 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 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,880 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:29:25,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,883 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:25,883 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:25,887 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:25,911 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:29:25,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:25,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:25,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,915 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:25,951 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:25,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:25,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:25,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:25,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:25,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:25,956 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:25,964 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:26,009 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:29:26,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:26,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:26,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:26,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:26,015 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:26,016 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:26,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:26,034 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:29:26,034 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:26,039 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:26,042 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:26,042 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:26,042 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 1 >= 0] [2020-07-29 01:29:26,079 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:26,083 INFO L393 LassoCheck]: Loop: "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d;" [2020-07-29 01:29:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,155 INFO L280 TraceCheckUtils]: 0: Hoare triple {2010#unseeded} havoc main_#res;havoc main_#t~nondet5; {2010#unseeded} is VALID [2020-07-29 01:29:26,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {2010#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~k~0 > 1073741823); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,159 INFO L280 TraceCheckUtils]: 3: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~z~0 < f_~k~0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,160 INFO L280 TraceCheckUtils]: 4: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,162 INFO L280 TraceCheckUtils]: 8: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,162 INFO L280 TraceCheckUtils]: 9: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,163 INFO L280 TraceCheckUtils]: 10: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,166 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#(and (>= oldRank0 ULTIMATE.start_f_~y~0) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2068#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:26,194 INFO L280 TraceCheckUtils]: 1: Hoare triple {2068#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2032#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,194 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:29:26,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:26,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:26,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,208 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:26,209 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2020-07-29 01:29:26,301 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 6 states. [2020-07-29 01:29:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:26,302 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:26,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:26,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 75 transitions. [2020-07-29 01:29:26,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:26,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,305 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 67 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,305 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:26,305 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:26,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,306 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:26,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 75 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,307 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 56 letters. Loop has 56 letters. [2020-07-29 01:29:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 56 letters. Loop has 56 letters. [2020-07-29 01:29:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 56 letters. Loop has 56 letters. [2020-07-29 01:29:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,324 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:29:26,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,325 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,404 INFO L280 TraceCheckUtils]: 0: Hoare triple {2010#unseeded} havoc main_#res;havoc main_#t~nondet5; {2010#unseeded} is VALID [2020-07-29 01:29:26,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {2010#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~k~0 > 1073741823); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,408 INFO L280 TraceCheckUtils]: 3: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~z~0 < f_~k~0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,410 INFO L280 TraceCheckUtils]: 5: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,411 INFO L280 TraceCheckUtils]: 6: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,412 INFO L280 TraceCheckUtils]: 7: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,415 INFO L280 TraceCheckUtils]: 10: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,421 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,447 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#(and (>= oldRank0 ULTIMATE.start_f_~y~0) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2173#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:26,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {2173#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2032#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,449 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:29:26,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:26,460 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,461 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:26,461 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2020-07-29 01:29:26,550 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 56 states and 75 transitions. Complement of second has 6 states. [2020-07-29 01:29:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:26,551 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:26,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,551 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:26,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 75 transitions. [2020-07-29 01:29:26,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:29:26,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,554 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 67 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,555 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:26,555 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:26,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,556 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:26,556 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 75 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,557 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 56 letters. Loop has 56 letters. [2020-07-29 01:29:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 56 letters. Loop has 56 letters. [2020-07-29 01:29:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 56 letters. Loop has 56 letters. [2020-07-29 01:29:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 75 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,576 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2020-07-29 01:29:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,577 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:26,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {2010#unseeded} havoc main_#res;havoc main_#t~nondet5; {2010#unseeded} is VALID [2020-07-29 01:29:26,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {2010#unseeded} assume 0 != main_#t~nondet5;havoc main_#t~nondet5;f_#in~d := 1;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~k~0 > 1073741823); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,683 INFO L280 TraceCheckUtils]: 3: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(f_~z~0 < f_~k~0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,684 INFO L280 TraceCheckUtils]: 4: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,685 INFO L280 TraceCheckUtils]: 5: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,686 INFO L280 TraceCheckUtils]: 7: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,688 INFO L280 TraceCheckUtils]: 9: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,688 INFO L280 TraceCheckUtils]: 10: Hoare triple {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2029#(and unseeded (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,692 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:26,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {2030#(and (>= oldRank0 ULTIMATE.start_f_~y~0) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2278#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:26,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {2278#(and (<= 1 ULTIMATE.start_f_~d) (< 0 ULTIMATE.start_f_~y~0) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2032#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 1)) 0))} is VALID [2020-07-29 01:29:26,714 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:29:26,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:26,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:26,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,739 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:26,739 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31 Second operand 4 states. [2020-07-29 01:29:26,836 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 48 states and 67 transitions. cyclomatic complexity: 31. Second operand 4 states. Result 59 states and 80 transitions. Complement of second has 5 states. [2020-07-29 01:29:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:26,837 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:26,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 67 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:26,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 80 transitions. [2020-07-29 01:29:26,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 67 transitions. cyclomatic complexity: 31 [2020-07-29 01:29:26,840 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:29:26,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:26,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:26,841 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 59 states and 80 transitions. cyclomatic complexity: 33 [2020-07-29 01:29:26,841 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:26,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:29:26,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:29:26,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:29:26,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:26,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:26,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:26,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 67 transitions. cyclomatic complexity: 31 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 80 transitions. cyclomatic complexity: 33 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:26,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,855 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-29 01:29:26,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:26,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:29:26,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:29:26,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 80 transitions. cyclomatic complexity: 33 [2020-07-29 01:29:26,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 25 states and 34 transitions. [2020-07-29 01:29:26,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:29:26,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:29:26,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 34 transitions. [2020-07-29 01:29:26,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:26,861 INFO L688 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 01:29:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 34 transitions. [2020-07-29 01:29:26,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-29 01:29:26,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:26,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states and 34 transitions. Second operand 25 states. [2020-07-29 01:29:26,863 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states and 34 transitions. Second operand 25 states. [2020-07-29 01:29:26,864 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 25 states. [2020-07-29 01:29:26,864 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:26,865 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-29 01:29:26,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2020-07-29 01:29:26,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:26,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:26,866 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states and 34 transitions. [2020-07-29 01:29:26,866 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states and 34 transitions. [2020-07-29 01:29:26,866 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:26,867 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-29 01:29:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2020-07-29 01:29:26,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:26,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:26,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:26,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:29:26,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-07-29 01:29:26,869 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 01:29:26,869 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-07-29 01:29:26,869 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:29:26,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2020-07-29 01:29:26,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:26,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:26,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:26,871 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:26,871 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:29:26,871 INFO L794 eck$LassoCheckResult]: Stem: 2354#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5; 2355#L41 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; 2356#L18-1 assume !(f_~k~0 > 1073741823); 2357#L23-3 assume !(f_~z~0 < f_~k~0); 2360#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 2361#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 2373#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 2372#L29-3 assume 0 != f_#t~nondet3;havoc f_#t~nondet3; 2370#L30-1 f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; 2369#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 2367#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 2366#L29-5 [2020-07-29 01:29:26,871 INFO L796 eck$LassoCheckResult]: Loop: 2366#L29-5 assume !!(f_~x~0 > 0 && f_~y~0 > 0); 2365#L29-3 assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; 2366#L29-5 [2020-07-29 01:29:26,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash 755756756, now seen corresponding path program 3 times [2020-07-29 01:29:26,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:26,872 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141566205] [2020-07-29 01:29:26,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:26,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:26,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:26,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:26,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:26,886 INFO L82 PathProgramCache]: Analyzing trace with hash 3112, now seen corresponding path program 3 times [2020-07-29 01:29:26,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:26,887 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256502619] [2020-07-29 01:29:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:26,889 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:26,891 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:26,892 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:26,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:26,892 INFO L82 PathProgramCache]: Analyzing trace with hash 432771643, now seen corresponding path program 4 times [2020-07-29 01:29:26,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:26,893 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716123129] [2020-07-29 01:29:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:26,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:26,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:26,906 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:27,057 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:27,057 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:27,057 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:27,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:27,057 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:27,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:27,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:27,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration10_Lasso [2020-07-29 01:29:27,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:27,058 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:27,066 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:29:27,071 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:29:27,080 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:29:27,085 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:29:27,095 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:29:27,107 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:29:27,109 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:29:27,112 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:29:27,115 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:29:27,119 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:29:27,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:27,311 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,314 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,317 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,317 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_#t~nondet3=0} Honda state: {ULTIMATE.start_f_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,339 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,339 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,342 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,342 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~k~0=0, ULTIMATE.start_f_~z~0=0} Honda state: {ULTIMATE.start_f_~k~0=-14, ULTIMATE.start_f_~z~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,364 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,367 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,367 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_f_~x~0=0} Honda state: {ULTIMATE.start_f_~x~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,389 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,389 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,391 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,391 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,416 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:27,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,536 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:27,537 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:27,537 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:27,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:27,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:27,538 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:27,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:27,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:27,538 INFO L133 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-SAS2010-Fig1.c_Iteration10_Lasso [2020-07-29 01:29:27,538 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:27,538 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:27,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:27,550 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:29:27,557 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:29:27,563 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:29:27,566 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:29:27,578 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:29:27,583 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:29:27,587 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:29:27,590 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:29:27,592 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:29:27,783 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:27,784 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,801 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:29:27,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:27,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:27,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:27,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:27,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:27,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:27,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:27,807 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 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,829 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:29:27,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:27,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:27,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:27,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:27,832 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:27,832 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:27,837 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 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,859 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:29:27,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:27,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:27,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:27,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:27,862 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:27,862 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:27,866 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 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,888 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:29:27,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:27,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:27,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:27,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:27,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:27,890 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:27,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:27,891 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 142 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 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,912 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:29:27,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:27,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:27,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:27,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:27,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:29:27,916 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:29:27,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:27,939 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:29:27,939 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:27,942 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,944 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 01:29:27,944 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:27,944 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~y~0) = 1*ULTIMATE.start_f_~y~0 Supporting invariants [1*ULTIMATE.start_f_~d - 2 >= 0] [2020-07-29 01:29:27,973 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2020-07-29 01:29:27,977 INFO L393 LassoCheck]: Loop: "assume !!(f_~x~0 > 0 && f_~y~0 > 0);" "assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d;" [2020-07-29 01:29:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {2494#unseeded} havoc main_#res;havoc main_#t~nondet5; {2494#unseeded} is VALID [2020-07-29 01:29:28,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {2494#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,060 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,061 INFO L280 TraceCheckUtils]: 3: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~z~0 < f_~k~0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,061 INFO L280 TraceCheckUtils]: 4: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,062 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,063 INFO L280 TraceCheckUtils]: 7: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,067 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,068 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,071 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,094 INFO L280 TraceCheckUtils]: 0: Hoare triple {2514#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) (>= oldRank0 ULTIMATE.start_f_~y~0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2552#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:28,095 INFO L280 TraceCheckUtils]: 1: Hoare triple {2552#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2516#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 2)) 0))} is VALID [2020-07-29 01:29:28,096 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:29:28,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:28,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:28,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,106 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:28,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 01:29:28,157 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2020-07-29 01:29:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:28,157 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:28,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,158 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:28,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,159 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,159 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2020-07-29 01:29:28,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,160 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,160 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,160 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:28,161 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:28,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,161 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:28,162 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 42 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,162 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:28,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:29:28,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:29:28,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:29:28,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,173 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:28,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:29:28,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,175 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:28,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,244 INFO L280 TraceCheckUtils]: 0: Hoare triple {2494#unseeded} havoc main_#res;havoc main_#t~nondet5; {2494#unseeded} is VALID [2020-07-29 01:29:28,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {2494#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~z~0 < f_~k~0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,260 INFO L280 TraceCheckUtils]: 8: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,268 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,271 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {2514#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) (>= oldRank0 ULTIMATE.start_f_~y~0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2634#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:28,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {2634#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2516#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 2)) 0))} is VALID [2020-07-29 01:29:28,294 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:29:28,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:28,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:28,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:28,305 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 01:29:28,349 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 33 states and 42 transitions. Complement of second has 6 states. [2020-07-29 01:29:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:28,350 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:28,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,350 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,350 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:28,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,351 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2020-07-29 01:29:28,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,352 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:28,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:28,353 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,353 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:28,353 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 33 states and 42 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,354 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:29:28,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:29:28,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 33 letters. Loop has 33 letters. [2020-07-29 01:29:28,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 33 states and 42 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,365 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:28,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:29:28,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,366 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {2494#unseeded} havoc main_#res;havoc main_#t~nondet5; {2494#unseeded} is VALID [2020-07-29 01:29:28,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {2494#unseeded} assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;f_#in~d := 2;havoc f_#t~nondet0, f_#t~nondet1, f_#t~nondet2, f_#t~nondet3, f_#t~nondet4, f_~d, f_~x~0, f_~y~0, f_~k~0, f_~z~0;f_~d := f_#in~d;f_~x~0 := f_#t~nondet0;havoc f_#t~nondet0;f_~y~0 := f_#t~nondet1;havoc f_#t~nondet1;f_~k~0 := f_#t~nondet2;havoc f_#t~nondet2;f_~z~0 := 1; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~k~0 > 1073741823); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,448 INFO L280 TraceCheckUtils]: 3: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(f_~z~0 < f_~k~0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,449 INFO L280 TraceCheckUtils]: 4: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,450 INFO L280 TraceCheckUtils]: 6: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,450 INFO L280 TraceCheckUtils]: 7: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume 0 != f_#t~nondet3;havoc f_#t~nondet3; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,451 INFO L280 TraceCheckUtils]: 8: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} f_~x~0 := f_~x~0 - f_~d;f_~y~0 := f_#t~nondet4;havoc f_#t~nondet4;f_~z~0 := f_~z~0 - 1; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,451 INFO L280 TraceCheckUtils]: 9: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,452 INFO L280 TraceCheckUtils]: 10: Hoare triple {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2513#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) unseeded)} is VALID [2020-07-29 01:29:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,455 WARN L261 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:29:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:28,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:28,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {2514#(and (>= (+ ULTIMATE.start_f_~d (- 2)) 0) (>= oldRank0 ULTIMATE.start_f_~y~0))} assume !!(f_~x~0 > 0 && f_~y~0 > 0); {2716#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} is VALID [2020-07-29 01:29:28,481 INFO L280 TraceCheckUtils]: 1: Hoare triple {2716#(and (< 0 ULTIMATE.start_f_~y~0) (<= 2 ULTIMATE.start_f_~d) (<= ULTIMATE.start_f_~y~0 oldRank0))} assume !(0 != f_#t~nondet3);havoc f_#t~nondet3;f_~y~0 := f_~y~0 - f_~d; {2516#(and (or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_f_~y~0)) unseeded) (>= (+ ULTIMATE.start_f_~d (- 2)) 0))} is VALID [2020-07-29 01:29:28,482 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:29:28,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:28,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:28,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,492 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:29:28,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15 Second operand 4 states. [2020-07-29 01:29:28,542 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 36 states and 47 transitions. Complement of second has 5 states. [2020-07-29 01:29:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:28,543 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:28,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,543 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,543 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,543 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:28,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,544 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:28,544 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:28,544 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. [2020-07-29 01:29:28,545 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:28,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:28,546 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 34 transitions. cyclomatic complexity: 15 [2020-07-29 01:29:28,546 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:29:28,546 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:28,547 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:29:28,547 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:28,547 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 47 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:28,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 47 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:28,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:28,547 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:29:28,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:29:28,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:29:28,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:29:28,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:28,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:28,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:29:28,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 34 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 47 transitions. cyclomatic complexity: 17 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:29:28,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,555 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:28,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:29:28,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:29:28,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:29:28,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:29:28,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:28,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:28,557 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:28,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2020-07-29 01:29:28,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:29:28,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:29:28,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:29:28,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:29:28,558 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:28,558 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:28,558 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:29:28,558 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:29:28,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:29:28,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:29:28,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:29:28,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:29:28 BoogieIcfgContainer [2020-07-29 01:29:28,565 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:29:28,565 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:29:28,565 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:29:28,565 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:29:28,566 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:47" (3/4) ... [2020-07-29 01:29:28,569 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:29:28,569 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:29:28,572 INFO L168 Benchmark]: Toolchain (without parser) took 41652.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 961.6 MB in the beginning and 976.5 MB in the end (delta: -14.9 MB). Peak memory consumption was 297.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:28,572 INFO L168 Benchmark]: CDTParser took 0.36 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:29:28,572 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.31 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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:29:28,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:28,573 INFO L168 Benchmark]: Boogie Preprocessor took 25.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:28,573 INFO L168 Benchmark]: RCFGBuilder took 326.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:28,573 INFO L168 Benchmark]: BuchiAutomizer took 40921.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 1.0 GB in the beginning and 976.5 MB in the end (delta: 63.7 MB). Peak memory consumption was 303.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:29:28,574 INFO L168 Benchmark]: Witness Printer took 4.46 ms. Allocated memory is still 1.3 GB. Free memory is still 976.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:29:28,575 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.36 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 264.31 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 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 101.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 72.9 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -110.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 326.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 21.4 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 40921.26 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 239.6 MB). Free memory was 1.0 GB in the beginning and 976.5 MB in the end (delta: 63.7 MB). Peak memory consumption was 303.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.46 ms. Allocated memory is still 1.3 GB. Free memory is still 976.5 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 10 terminating modules (0 trivial, 8 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -2 * z + 2147483645 and consists of 5 locations. One deterministic module has affine ranking function -1 * z + k and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function x + -1 * d and consists of 5 locations. One deterministic module has affine ranking function x + 1 and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 40.8s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 37.0s. Construction of modules took 0.2s. Büchi inclusion checks took 3.1s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 22 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 48 states and ocurred in iteration 8. Nontrivial modules had stage [8, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 182 SDtfs, 284 SDslu, 59 SDs, 0 SdLazy, 136 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital36 mio100 ax100 hnf91 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq170 hnf91 smp100 dnf100 smp100 tf101 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 166ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 59 LassoNonterminationAnalysisSatUnbounded: 3 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 26.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...