./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 0f05083e48363355a3ce54df75e6818789b9deb1 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:18:14,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:18:14,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:18:14,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:18:14,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:18:14,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:18:14,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:18:14,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:18:14,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:18:14,123 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:18:14,124 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:18:14,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:18:14,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:18:14,127 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:18:14,128 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:18:14,129 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:18:14,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:18:14,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:18:14,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:18:14,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:18:14,141 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:18:14,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:18:14,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:18:14,149 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:18:14,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:18:14,156 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:18:14,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:18:14,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:18:14,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:18:14,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:18:14,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:18:14,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:18:14,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:18:14,163 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:18:14,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:18:14,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:18:14,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:18:14,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:18:14,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:18:14,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:18:14,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:18:14,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:18:14,199 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:18:14,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:18:14,200 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:18:14,201 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:18:14,201 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:18:14,201 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:18:14,202 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:18:14,202 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:18:14,202 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:18:14,203 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:18:14,203 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:18:14,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:18:14,204 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:18:14,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:18:14,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:18:14,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:18:14,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:18:14,205 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:18:14,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:18:14,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:18:14,206 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:18:14,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:18:14,207 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:18:14,207 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:18:14,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:18:14,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:18:14,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:18:14,208 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:18:14,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:18:14,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:18:14,209 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:18:14,209 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:18:14,210 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:18:14,211 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f05083e48363355a3ce54df75e6818789b9deb1 [2020-07-29 03:18:14,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:18:14,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:18:14,566 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:18:14,568 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:18:14,568 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:18:14,569 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-07-29 03:18:14,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e060a320e/a42df075e6454e0dbbbdb0a8ec2e875d/FLAGc12be7685 [2020-07-29 03:18:15,162 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:18:15,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-07-29 03:18:15,173 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e060a320e/a42df075e6454e0dbbbdb0a8ec2e875d/FLAGc12be7685 [2020-07-29 03:18:15,459 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e060a320e/a42df075e6454e0dbbbdb0a8ec2e875d [2020-07-29 03:18:15,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:18:15,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:18:15,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:15,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:18:15,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:18:15,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,475 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42ca22ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15, skipping insertion in model container [2020-07-29 03:18:15,476 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,483 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:18:15,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:18:15,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:15,773 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:18:15,888 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:15,904 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:18:15,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15 WrapperNode [2020-07-29 03:18:15,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:15,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:15,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:18:15,906 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:18:15,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:15,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:18:15,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:18:15,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:18:15,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:15,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (1/1) ... [2020-07-29 03:18:16,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:18:16,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:18:16,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:18:16,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:18:16,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (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 03:18:16,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:18:16,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:18:16,668 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:18:16,669 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-29 03:18:16,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:16 BoogieIcfgContainer [2020-07-29 03:18:16,673 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:18:16,674 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:18:16,674 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:18:16,678 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:18:16,679 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:16,680 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:18:15" (1/3) ... [2020-07-29 03:18:16,681 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e86636a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:16, skipping insertion in model container [2020-07-29 03:18:16,681 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:16,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:15" (2/3) ... [2020-07-29 03:18:16,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e86636a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:16, skipping insertion in model container [2020-07-29 03:18:16,682 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:16,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:16" (3/3) ... [2020-07-29 03:18:16,684 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-07-29 03:18:16,734 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:18:16,734 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:18:16,735 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:18:16,735 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:18:16,736 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:18:16,736 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:18:16,736 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:18:16,736 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:18:16,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states. [2020-07-29 03:18:16,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-07-29 03:18:16,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:16,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:16,803 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:16,803 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:16,803 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:18:16,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states. [2020-07-29 03:18:16,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2020-07-29 03:18:16,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:16,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:16,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:16,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:16,826 INFO L794 eck$LassoCheckResult]: Stem: 36#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 13#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 3#L175true assume !(0 == ~r1~0);init_~tmp~0 := 0; 22#L175-1true init_#res := init_~tmp~0; 55#L240true main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 24#L292true assume !(0 == main_~i2~0); 18#L292-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 35#L300-2true [2020-07-29 03:18:16,827 INFO L796 eck$LassoCheckResult]: Loop: 35#L300-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 42#L99true assume !(0 != ~mode1~0 % 256); 6#L113true assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; 4#L113-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 39#L99-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 31#L125true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 37#L128true assume !(node2_~m2~0 != ~nomsg~0); 34#L128-1true ~mode2~0 := 0; 28#L125-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 38#L150true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 23#L153true assume !(node3_~m3~0 != ~nomsg~0); 19#L153-1true ~mode3~0 := 0; 12#L150-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 20#L248true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 17#L248-1true check_#res := check_~tmp~1; 52#L268true main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 54#L324true assume !(0 == assert_~arg % 256); 48#L319true main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 35#L300-2true [2020-07-29 03:18:16,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:16,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-07-29 03:18:16,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:16,846 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42378215] [2020-07-29 03:18:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:17,114 INFO L280 TraceCheckUtils]: 0: Hoare triple {65#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {65#true} is VALID [2020-07-29 03:18:17,114 INFO L280 TraceCheckUtils]: 1: Hoare triple {65#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {65#true} is VALID [2020-07-29 03:18:17,115 INFO L280 TraceCheckUtils]: 2: Hoare triple {65#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {67#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:18:17,117 INFO L280 TraceCheckUtils]: 3: Hoare triple {67#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {68#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:18:17,118 INFO L280 TraceCheckUtils]: 4: Hoare triple {68#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; {69#(= 0 ULTIMATE.start_main_~i2~0)} is VALID [2020-07-29 03:18:17,119 INFO L280 TraceCheckUtils]: 5: Hoare triple {69#(= 0 ULTIMATE.start_main_~i2~0)} assume !(0 == main_~i2~0); {66#false} is VALID [2020-07-29 03:18:17,119 INFO L280 TraceCheckUtils]: 6: Hoare triple {66#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; {66#false} is VALID [2020-07-29 03:18:17,121 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 03:18:17,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42378215] [2020-07-29 03:18:17,123 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:17,123 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:17,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919675375] [2020-07-29 03:18:17,129 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:18:17,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:17,130 INFO L82 PathProgramCache]: Analyzing trace with hash -2097458972, now seen corresponding path program 1 times [2020-07-29 03:18:17,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:17,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050583075] [2020-07-29 03:18:17,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:17,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {70#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:17,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#true} assume !(0 != ~mode1~0 % 256); {70#true} is VALID [2020-07-29 03:18:17,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#true} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite0 := ~p1_new~0; {70#true} is VALID [2020-07-29 03:18:17,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {70#true} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {70#true} is VALID [2020-07-29 03:18:17,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {70#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:17,304 INFO L280 TraceCheckUtils]: 5: Hoare triple {70#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:17,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {70#true} assume !(node2_~m2~0 != ~nomsg~0); {70#true} is VALID [2020-07-29 03:18:17,305 INFO L280 TraceCheckUtils]: 7: Hoare triple {70#true} ~mode2~0 := 0; {70#true} is VALID [2020-07-29 03:18:17,305 INFO L280 TraceCheckUtils]: 8: Hoare triple {70#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:17,305 INFO L280 TraceCheckUtils]: 9: Hoare triple {70#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {70#true} is VALID [2020-07-29 03:18:17,306 INFO L280 TraceCheckUtils]: 10: Hoare triple {70#true} assume !(node3_~m3~0 != ~nomsg~0); {70#true} is VALID [2020-07-29 03:18:17,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {70#true} ~mode3~0 := 0; {70#true} is VALID [2020-07-29 03:18:17,306 INFO L280 TraceCheckUtils]: 12: Hoare triple {70#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {70#true} is VALID [2020-07-29 03:18:17,308 INFO L280 TraceCheckUtils]: 13: Hoare triple {70#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {72#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:17,309 INFO L280 TraceCheckUtils]: 14: Hoare triple {72#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {73#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:17,311 INFO L280 TraceCheckUtils]: 15: Hoare triple {73#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {74#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:17,313 INFO L280 TraceCheckUtils]: 16: Hoare triple {74#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {71#false} is VALID [2020-07-29 03:18:17,313 INFO L280 TraceCheckUtils]: 17: Hoare triple {71#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {71#false} is VALID [2020-07-29 03:18:17,316 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 03:18:17,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050583075] [2020-07-29 03:18:17,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:17,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:17,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975411959] [2020-07-29 03:18:17,319 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:17,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:17,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:17,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:17,334 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 5 states. [2020-07-29 03:18:17,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:17,850 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-07-29 03:18:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:18:17,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:17,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:17,878 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-07-29 03:18:17,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:17,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-07-29 03:18:17,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-07-29 03:18:17,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-07-29 03:18:17,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-07-29 03:18:17,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:17,905 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-07-29 03:18:17,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-07-29 03:18:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-07-29 03:18:17,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:17,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states and 130 transitions. Second operand 56 states. [2020-07-29 03:18:17,942 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states and 130 transitions. Second operand 56 states. [2020-07-29 03:18:17,944 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand 56 states. [2020-07-29 03:18:17,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:17,952 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-29 03:18:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-29 03:18:17,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:17,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:17,956 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 90 states and 130 transitions. [2020-07-29 03:18:17,956 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 90 states and 130 transitions. [2020-07-29 03:18:17,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:17,964 INFO L93 Difference]: Finished difference Result 90 states and 130 transitions. [2020-07-29 03:18:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2020-07-29 03:18:17,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:17,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:17,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:17,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:17,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 03:18:17,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-07-29 03:18:17,972 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-07-29 03:18:17,972 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-07-29 03:18:17,972 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:18:17,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-07-29 03:18:17,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:17,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:17,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:17,976 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:17,976 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:17,977 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 196#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 180#L175 assume 0 == ~r1~0; 181#L176 assume ~id1~0 >= 0; 209#L177 assume 0 == ~st1~0; 227#L178 assume ~send1~0 == ~id1~0; 190#L179 assume 0 == ~mode1~0 % 256; 191#L180 assume ~id2~0 >= 0; 219#L181 assume 0 == ~st2~0; 199#L182 assume ~send2~0 == ~id2~0; 200#L183 assume 0 == ~mode2~0 % 256; 225#L184 assume ~id3~0 >= 0; 232#L185 assume 0 == ~st3~0; 182#L186 assume ~send3~0 == ~id3~0; 183#L187 assume 0 == ~mode3~0 % 256; 212#L188 assume ~id1~0 != ~id2~0; 228#L189 assume ~id1~0 != ~id3~0; 192#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 193#L175-1 init_#res := init_~tmp~0; 205#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 208#L292 assume !(0 == main_~i2~0); 202#L292-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 203#L300-2 [2020-07-29 03:18:17,978 INFO L796 eck$LassoCheckResult]: Loop: 203#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 221#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 214#L103 assume !(node1_~m1~0 != ~nomsg~0); 213#L103-1 ~mode1~0 := 0; 179#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 217#L125 assume !(0 != ~mode2~0 % 256); 197#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 198#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 210#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 211#L150 assume !(0 != ~mode3~0 % 256); 224#L163 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 233#L163-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 194#L150-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 195#L248 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 186#L248-1 check_#res := check_~tmp~1; 201#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 231#L324 assume !(0 == assert_~arg % 256); 230#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 203#L300-2 [2020-07-29 03:18:17,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:17,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-07-29 03:18:17,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:17,979 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745511868] [2020-07-29 03:18:17,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:18,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:18,036 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:18,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:18,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:18,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2073672604, now seen corresponding path program 1 times [2020-07-29 03:18:18,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:18,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979933742] [2020-07-29 03:18:18,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:18,253 INFO L280 TraceCheckUtils]: 0: Hoare triple {419#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:18,253 INFO L280 TraceCheckUtils]: 1: Hoare triple {419#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:18,254 INFO L280 TraceCheckUtils]: 2: Hoare triple {419#true} assume !(node1_~m1~0 != ~nomsg~0); {419#true} is VALID [2020-07-29 03:18:18,254 INFO L280 TraceCheckUtils]: 3: Hoare triple {419#true} ~mode1~0 := 0; {419#true} is VALID [2020-07-29 03:18:18,255 INFO L280 TraceCheckUtils]: 4: Hoare triple {419#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:18,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {419#true} assume !(0 != ~mode2~0 % 256); {419#true} is VALID [2020-07-29 03:18:18,255 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {419#true} is VALID [2020-07-29 03:18:18,256 INFO L280 TraceCheckUtils]: 7: Hoare triple {419#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {419#true} is VALID [2020-07-29 03:18:18,256 INFO L280 TraceCheckUtils]: 8: Hoare triple {419#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {419#true} is VALID [2020-07-29 03:18:18,256 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#true} assume !(0 != ~mode3~0 % 256); {419#true} is VALID [2020-07-29 03:18:18,257 INFO L280 TraceCheckUtils]: 10: Hoare triple {419#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {419#true} is VALID [2020-07-29 03:18:18,257 INFO L280 TraceCheckUtils]: 11: Hoare triple {419#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {419#true} is VALID [2020-07-29 03:18:18,257 INFO L280 TraceCheckUtils]: 12: Hoare triple {419#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {419#true} is VALID [2020-07-29 03:18:18,259 INFO L280 TraceCheckUtils]: 13: Hoare triple {419#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; {421#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:18,260 INFO L280 TraceCheckUtils]: 14: Hoare triple {421#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {422#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:18,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {422#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {423#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:18,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {423#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {420#false} is VALID [2020-07-29 03:18:18,264 INFO L280 TraceCheckUtils]: 17: Hoare triple {420#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {420#false} is VALID [2020-07-29 03:18:18,266 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 03:18:18,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979933742] [2020-07-29 03:18:18,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:18,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:18,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898033844] [2020-07-29 03:18:18,267 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:18,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:18,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:18,269 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-07-29 03:18:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:18,559 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-07-29 03:18:18,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:18,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:18,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:18,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-07-29 03:18:18,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:18,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-07-29 03:18:18,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-07-29 03:18:18,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-07-29 03:18:18,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-07-29 03:18:18,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:18,596 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-07-29 03:18:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-07-29 03:18:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-07-29 03:18:18,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:18,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states and 73 transitions. Second operand 56 states. [2020-07-29 03:18:18,600 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states and 73 transitions. Second operand 56 states. [2020-07-29 03:18:18,600 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. Second operand 56 states. [2020-07-29 03:18:18,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:18,604 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2020-07-29 03:18:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2020-07-29 03:18:18,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:18,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:18,605 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states and 73 transitions. [2020-07-29 03:18:18,606 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states and 73 transitions. [2020-07-29 03:18:18,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:18,609 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2020-07-29 03:18:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 73 transitions. [2020-07-29 03:18:18,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:18,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:18,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:18,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-07-29 03:18:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-07-29 03:18:18,613 INFO L711 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-07-29 03:18:18,613 INFO L591 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-07-29 03:18:18,613 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:18:18,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-07-29 03:18:18,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-07-29 03:18:18,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:18,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:18,616 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:18,616 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:18,617 INFO L794 eck$LassoCheckResult]: Stem: 531#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 504#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 487#L175 assume 0 == ~r1~0; 488#L176 assume ~id1~0 >= 0; 518#L177 assume 0 == ~st1~0; 536#L178 assume ~send1~0 == ~id1~0; 498#L179 assume 0 == ~mode1~0 % 256; 499#L180 assume ~id2~0 >= 0; 528#L181 assume 0 == ~st2~0; 507#L182 assume ~send2~0 == ~id2~0; 508#L183 assume 0 == ~mode2~0 % 256; 534#L184 assume ~id3~0 >= 0; 541#L185 assume 0 == ~st3~0; 491#L186 assume ~send3~0 == ~id3~0; 492#L187 assume 0 == ~mode3~0 % 256; 519#L188 assume ~id1~0 != ~id2~0; 537#L189 assume ~id1~0 != ~id3~0; 500#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 501#L175-1 init_#res := init_~tmp~0; 514#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 517#L292 assume !(0 == main_~i2~0); 511#L292-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 512#L300-2 [2020-07-29 03:18:18,617 INFO L796 eck$LassoCheckResult]: Loop: 512#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 530#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 523#L103 assume !(node1_~m1~0 != ~nomsg~0); 522#L103-1 ~mode1~0 := 0; 490#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 525#L125 assume !(0 != ~mode2~0 % 256); 505#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 506#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 520#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 521#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 515#L153 assume !(node3_~m3~0 != ~nomsg~0); 497#L153-1 ~mode3~0 := 0; 502#L150-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 503#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 513#L249 assume ~r1~0 >= 3; 495#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 509#L248-1 check_#res := check_~tmp~1; 510#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 540#L324 assume !(0 == assert_~arg % 256); 539#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 512#L300-2 [2020-07-29 03:18:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:18,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-07-29 03:18:18,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:18,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976077593] [2020-07-29 03:18:18,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:18,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:18,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:18,691 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:18,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:18,697 INFO L82 PathProgramCache]: Analyzing trace with hash 560827798, now seen corresponding path program 1 times [2020-07-29 03:18:18,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:18,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414686648] [2020-07-29 03:18:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:18,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {660#true} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:18,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {660#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:18,749 INFO L280 TraceCheckUtils]: 2: Hoare triple {660#true} assume !(node1_~m1~0 != ~nomsg~0); {660#true} is VALID [2020-07-29 03:18:18,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {660#true} ~mode1~0 := 0; {660#true} is VALID [2020-07-29 03:18:18,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {660#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:18,750 INFO L280 TraceCheckUtils]: 5: Hoare triple {660#true} assume !(0 != ~mode2~0 % 256); {660#true} is VALID [2020-07-29 03:18:18,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {660#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {660#true} is VALID [2020-07-29 03:18:18,750 INFO L280 TraceCheckUtils]: 7: Hoare triple {660#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {660#true} is VALID [2020-07-29 03:18:18,751 INFO L280 TraceCheckUtils]: 8: Hoare triple {660#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:18,751 INFO L280 TraceCheckUtils]: 9: Hoare triple {660#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {660#true} is VALID [2020-07-29 03:18:18,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {660#true} assume !(node3_~m3~0 != ~nomsg~0); {660#true} is VALID [2020-07-29 03:18:18,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#true} ~mode3~0 := 0; {660#true} is VALID [2020-07-29 03:18:18,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {660#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {660#true} is VALID [2020-07-29 03:18:18,752 INFO L280 TraceCheckUtils]: 13: Hoare triple {660#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {660#true} is VALID [2020-07-29 03:18:18,753 INFO L280 TraceCheckUtils]: 14: Hoare triple {660#true} assume ~r1~0 >= 3; {662#(< 2 ~r1~0)} is VALID [2020-07-29 03:18:18,754 INFO L280 TraceCheckUtils]: 15: Hoare triple {662#(< 2 ~r1~0)} assume ~r1~0 < 3;check_~tmp~1 := 1; {661#false} is VALID [2020-07-29 03:18:18,755 INFO L280 TraceCheckUtils]: 16: Hoare triple {661#false} check_#res := check_~tmp~1; {661#false} is VALID [2020-07-29 03:18:18,755 INFO L280 TraceCheckUtils]: 17: Hoare triple {661#false} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {661#false} is VALID [2020-07-29 03:18:18,756 INFO L280 TraceCheckUtils]: 18: Hoare triple {661#false} assume !(0 == assert_~arg % 256); {661#false} is VALID [2020-07-29 03:18:18,756 INFO L280 TraceCheckUtils]: 19: Hoare triple {661#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {661#false} is VALID [2020-07-29 03:18:18,757 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 03:18:18,757 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414686648] [2020-07-29 03:18:18,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:18,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:18,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736111442] [2020-07-29 03:18:18,758 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:18,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:18,759 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-07-29 03:18:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:18,944 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-07-29 03:18:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:18:18,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:18,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:18,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-07-29 03:18:18,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-07-29 03:18:18,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-07-29 03:18:18,982 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-07-29 03:18:18,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-07-29 03:18:18,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-07-29 03:18:18,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:18,983 INFO L688 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-07-29 03:18:18,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-07-29 03:18:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-07-29 03:18:18,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:18,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states and 113 transitions. Second operand 84 states. [2020-07-29 03:18:18,990 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states and 113 transitions. Second operand 84 states. [2020-07-29 03:18:18,990 INFO L87 Difference]: Start difference. First operand 84 states and 113 transitions. Second operand 84 states. [2020-07-29 03:18:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:18,994 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-07-29 03:18:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2020-07-29 03:18:18,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:18,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:18,996 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states and 113 transitions. [2020-07-29 03:18:18,996 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states and 113 transitions. [2020-07-29 03:18:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:19,000 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-07-29 03:18:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 113 transitions. [2020-07-29 03:18:19,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:19,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:19,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:19,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-07-29 03:18:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-07-29 03:18:19,008 INFO L711 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-07-29 03:18:19,008 INFO L591 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-07-29 03:18:19,008 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:18:19,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-07-29 03:18:19,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-07-29 03:18:19,011 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:19,011 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:19,013 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:19,014 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:19,015 INFO L794 eck$LassoCheckResult]: Stem: 794#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 764#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 747#L175 assume 0 == ~r1~0; 748#L176 assume ~id1~0 >= 0; 778#L177 assume 0 == ~st1~0; 801#L178 assume ~send1~0 == ~id1~0; 758#L179 assume 0 == ~mode1~0 % 256; 759#L180 assume ~id2~0 >= 0; 790#L181 assume 0 == ~st2~0; 767#L182 assume ~send2~0 == ~id2~0; 768#L183 assume 0 == ~mode2~0 % 256; 798#L184 assume ~id3~0 >= 0; 806#L185 assume 0 == ~st3~0; 751#L186 assume ~send3~0 == ~id3~0; 752#L187 assume 0 == ~mode3~0 % 256; 779#L188 assume ~id1~0 != ~id2~0; 802#L189 assume ~id1~0 != ~id3~0; 760#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 761#L175-1 init_#res := init_~tmp~0; 774#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; 777#L292 assume !(0 == main_~i2~0); 771#L292-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 772#L300-2 [2020-07-29 03:18:19,015 INFO L796 eck$LassoCheckResult]: Loop: 772#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 826#L99 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 784#L103 assume !(node1_~m1~0 != ~nomsg~0); 782#L103-1 ~mode1~0 := 0; 783#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 823#L125 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 820#L128 assume !(node2_~m2~0 != ~nomsg~0); 818#L128-1 ~mode2~0 := 0; 816#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 815#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 775#L153 assume !(node3_~m3~0 != ~nomsg~0); 757#L153-1 ~mode3~0 := 0; 762#L150-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 763#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 773#L249 assume !(~r1~0 >= 3); 754#L252 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 755#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 830#L248-1 check_#res := check_~tmp~1; 829#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 828#L324 assume !(0 == assert_~arg % 256); 827#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 772#L300-2 [2020-07-29 03:18:19,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:19,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-07-29 03:18:19,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:19,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001426289] [2020-07-29 03:18:19,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:19,052 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:19,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:19,093 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:19,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:19,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1765245589, now seen corresponding path program 1 times [2020-07-29 03:18:19,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:19,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614888215] [2020-07-29 03:18:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:19,126 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:19,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:19,144 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash 487220951, now seen corresponding path program 1 times [2020-07-29 03:18:19,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:19,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954319812] [2020-07-29 03:18:19,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:19,198 INFO L280 TraceCheckUtils]: 0: Hoare triple {1006#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {1006#true} is VALID [2020-07-29 03:18:19,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {1006#true} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1006#true} is VALID [2020-07-29 03:18:19,199 INFO L280 TraceCheckUtils]: 2: Hoare triple {1006#true} assume 0 == ~r1~0; {1006#true} is VALID [2020-07-29 03:18:19,199 INFO L280 TraceCheckUtils]: 3: Hoare triple {1006#true} assume ~id1~0 >= 0; {1006#true} is VALID [2020-07-29 03:18:19,199 INFO L280 TraceCheckUtils]: 4: Hoare triple {1006#true} assume 0 == ~st1~0; {1006#true} is VALID [2020-07-29 03:18:19,200 INFO L280 TraceCheckUtils]: 5: Hoare triple {1006#true} assume ~send1~0 == ~id1~0; {1006#true} is VALID [2020-07-29 03:18:19,201 INFO L280 TraceCheckUtils]: 6: Hoare triple {1006#true} assume 0 == ~mode1~0 % 256; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,202 INFO L280 TraceCheckUtils]: 7: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,205 INFO L280 TraceCheckUtils]: 10: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,206 INFO L280 TraceCheckUtils]: 12: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,207 INFO L280 TraceCheckUtils]: 13: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,208 INFO L280 TraceCheckUtils]: 14: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,209 INFO L280 TraceCheckUtils]: 15: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,209 INFO L280 TraceCheckUtils]: 16: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,210 INFO L280 TraceCheckUtils]: 17: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,211 INFO L280 TraceCheckUtils]: 18: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,212 INFO L280 TraceCheckUtils]: 19: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,213 INFO L280 TraceCheckUtils]: 20: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == main_~i2~0); {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,213 INFO L280 TraceCheckUtils]: 21: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,214 INFO L280 TraceCheckUtils]: 22: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:19,216 INFO L280 TraceCheckUtils]: 23: Hoare triple {1008#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:19,216 INFO L280 TraceCheckUtils]: 24: Hoare triple {1007#false} assume !(node1_~m1~0 != ~nomsg~0); {1007#false} is VALID [2020-07-29 03:18:19,216 INFO L280 TraceCheckUtils]: 25: Hoare triple {1007#false} ~mode1~0 := 0; {1007#false} is VALID [2020-07-29 03:18:19,217 INFO L280 TraceCheckUtils]: 26: Hoare triple {1007#false} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:19,217 INFO L280 TraceCheckUtils]: 27: Hoare triple {1007#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:19,217 INFO L280 TraceCheckUtils]: 28: Hoare triple {1007#false} assume !(node2_~m2~0 != ~nomsg~0); {1007#false} is VALID [2020-07-29 03:18:19,218 INFO L280 TraceCheckUtils]: 29: Hoare triple {1007#false} ~mode2~0 := 0; {1007#false} is VALID [2020-07-29 03:18:19,218 INFO L280 TraceCheckUtils]: 30: Hoare triple {1007#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:19,218 INFO L280 TraceCheckUtils]: 31: Hoare triple {1007#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1007#false} is VALID [2020-07-29 03:18:19,219 INFO L280 TraceCheckUtils]: 32: Hoare triple {1007#false} assume !(node3_~m3~0 != ~nomsg~0); {1007#false} is VALID [2020-07-29 03:18:19,219 INFO L280 TraceCheckUtils]: 33: Hoare triple {1007#false} ~mode3~0 := 0; {1007#false} is VALID [2020-07-29 03:18:19,220 INFO L280 TraceCheckUtils]: 34: Hoare triple {1007#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1007#false} is VALID [2020-07-29 03:18:19,220 INFO L280 TraceCheckUtils]: 35: Hoare triple {1007#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1007#false} is VALID [2020-07-29 03:18:19,220 INFO L280 TraceCheckUtils]: 36: Hoare triple {1007#false} assume !(~r1~0 >= 3); {1007#false} is VALID [2020-07-29 03:18:19,221 INFO L280 TraceCheckUtils]: 37: Hoare triple {1007#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1007#false} is VALID [2020-07-29 03:18:19,221 INFO L280 TraceCheckUtils]: 38: Hoare triple {1007#false} assume ~r1~0 < 3;check_~tmp~1 := 1; {1007#false} is VALID [2020-07-29 03:18:19,221 INFO L280 TraceCheckUtils]: 39: Hoare triple {1007#false} check_#res := check_~tmp~1; {1007#false} is VALID [2020-07-29 03:18:19,222 INFO L280 TraceCheckUtils]: 40: Hoare triple {1007#false} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1007#false} is VALID [2020-07-29 03:18:19,222 INFO L280 TraceCheckUtils]: 41: Hoare triple {1007#false} assume !(0 == assert_~arg % 256); {1007#false} is VALID [2020-07-29 03:18:19,223 INFO L280 TraceCheckUtils]: 42: Hoare triple {1007#false} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {1007#false} is VALID [2020-07-29 03:18:19,227 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 03:18:19,228 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954319812] [2020-07-29 03:18:19,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:19,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:19,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010103920] [2020-07-29 03:18:19,546 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 98 [2020-07-29 03:18:19,873 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2020-07-29 03:18:19,888 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:19,889 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:19,889 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:19,889 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:19,890 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:18:19,890 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:19,890 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:19,890 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:19,890 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:18:19,890 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:19,890 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:19,953 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 03:18:19,966 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 03:18:19,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 03:18:19,979 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 03:18:19,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 03:18:19,993 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 03:18:20,020 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 03:18:20,029 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 03:18:20,034 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 03:18:20,054 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 03:18:20,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 03:18:20,072 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 03:18:20,077 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 03:18:20,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 03:18:20,088 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 03:18:20,091 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 03:18:20,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 03:18:20,099 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 03:18:20,103 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 03:18:20,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 03:18:21,025 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:21,026 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:21,034 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:18:21,035 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:21,065 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:18:21,065 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:18:21,094 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:18:21,096 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:21,096 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:21,097 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:21,097 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:21,097 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:18:21,097 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:21,097 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:21,098 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:21,098 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-07-29 03:18:21,098 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:21,098 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:21,159 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 03:18:21,166 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 03:18:21,169 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 03:18:21,175 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 03:18:21,183 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 03:18:21,187 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 03:18:21,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 03:18:21,217 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 03:18:21,220 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 03:18:21,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 03:18:21,255 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 03:18:21,262 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 03:18:21,270 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 03:18:21,275 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 03:18:21,278 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 03:18:21,287 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 03:18:21,290 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 03:18:21,295 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 03:18:21,299 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 03:18:21,303 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 03:18:22,251 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:22,256 INFO L489 LassoAnalysis]: Using template 'affine'. 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 03:18:22,269 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 03:18:22,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:22,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:22,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:22,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:22,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:22,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:22,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:22,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:18:22,286 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:18:22,286 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:22,295 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:18:22,296 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:18:22,297 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:18:22,297 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:22,346 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:18:22,406 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 3;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg;" "assume !(0 == assert_~arg % 256);" "main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18;" [2020-07-29 03:18:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:22,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:22,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:18:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:22,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:22,677 INFO L280 TraceCheckUtils]: 0: Hoare triple {1009#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; {1009#unseeded} is VALID [2020-07-29 03:18:22,684 INFO L280 TraceCheckUtils]: 1: Hoare triple {1009#unseeded} havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {1009#unseeded} assume 0 == ~r1~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {1009#unseeded} assume ~id1~0 >= 0; {1009#unseeded} is VALID [2020-07-29 03:18:22,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {1009#unseeded} assume 0 == ~st1~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,687 INFO L280 TraceCheckUtils]: 5: Hoare triple {1009#unseeded} assume ~send1~0 == ~id1~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,687 INFO L280 TraceCheckUtils]: 6: Hoare triple {1009#unseeded} assume 0 == ~mode1~0 % 256; {1009#unseeded} is VALID [2020-07-29 03:18:22,688 INFO L280 TraceCheckUtils]: 7: Hoare triple {1009#unseeded} assume ~id2~0 >= 0; {1009#unseeded} is VALID [2020-07-29 03:18:22,688 INFO L280 TraceCheckUtils]: 8: Hoare triple {1009#unseeded} assume 0 == ~st2~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,689 INFO L280 TraceCheckUtils]: 9: Hoare triple {1009#unseeded} assume ~send2~0 == ~id2~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,690 INFO L280 TraceCheckUtils]: 10: Hoare triple {1009#unseeded} assume 0 == ~mode2~0 % 256; {1009#unseeded} is VALID [2020-07-29 03:18:22,690 INFO L280 TraceCheckUtils]: 11: Hoare triple {1009#unseeded} assume ~id3~0 >= 0; {1009#unseeded} is VALID [2020-07-29 03:18:22,691 INFO L280 TraceCheckUtils]: 12: Hoare triple {1009#unseeded} assume 0 == ~st3~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {1009#unseeded} assume ~send3~0 == ~id3~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,708 INFO L280 TraceCheckUtils]: 14: Hoare triple {1009#unseeded} assume 0 == ~mode3~0 % 256; {1009#unseeded} is VALID [2020-07-29 03:18:22,709 INFO L280 TraceCheckUtils]: 15: Hoare triple {1009#unseeded} assume ~id1~0 != ~id2~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,710 INFO L280 TraceCheckUtils]: 16: Hoare triple {1009#unseeded} assume ~id1~0 != ~id3~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,710 INFO L280 TraceCheckUtils]: 17: Hoare triple {1009#unseeded} assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; {1009#unseeded} is VALID [2020-07-29 03:18:22,712 INFO L280 TraceCheckUtils]: 18: Hoare triple {1009#unseeded} init_#res := init_~tmp~0; {1009#unseeded} is VALID [2020-07-29 03:18:22,715 INFO L280 TraceCheckUtils]: 19: Hoare triple {1009#unseeded} main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16; {1009#unseeded} is VALID [2020-07-29 03:18:22,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {1009#unseeded} assume !(0 == main_~i2~0); {1009#unseeded} is VALID [2020-07-29 03:18:22,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {1009#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; {1009#unseeded} is VALID [2020-07-29 03:18:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:22,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:18:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:22,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:22,821 INFO L280 TraceCheckUtils]: 0: Hoare triple {1012#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))} assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,824 INFO L280 TraceCheckUtils]: 2: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(node1_~m1~0 != ~nomsg~0); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,824 INFO L280 TraceCheckUtils]: 3: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode1~0 := 0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,826 INFO L280 TraceCheckUtils]: 5: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,827 INFO L280 TraceCheckUtils]: 6: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(node2_~m2~0 != ~nomsg~0); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,828 INFO L280 TraceCheckUtils]: 7: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode2~0 := 0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,829 INFO L280 TraceCheckUtils]: 8: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,830 INFO L280 TraceCheckUtils]: 9: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,831 INFO L280 TraceCheckUtils]: 10: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(node3_~m3~0 != ~nomsg~0); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,832 INFO L280 TraceCheckUtils]: 11: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~mode3~0 := 0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(~r1~0 >= 3); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,837 INFO L280 TraceCheckUtils]: 16: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume ~r1~0 < 3;check_~tmp~1 := 1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} check_#res := check_~tmp~1; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,838 INFO L280 TraceCheckUtils]: 18: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,839 INFO L280 TraceCheckUtils]: 19: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} assume !(0 == assert_~arg % 256); {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} is VALID [2020-07-29 03:18:22,841 INFO L280 TraceCheckUtils]: 20: Hoare triple {1090#(and (<= 11 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))) (< ULTIMATE.start_main_~i2~0 6))} main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; {1022#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 11))) unseeded)} is VALID [2020-07-29 03:18:22,841 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 03:18:22,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:22,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:22,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:22,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:22,874 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:18:22,876 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-07-29 03:18:23,060 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 145 states and 204 transitions. Complement of second has 4 states. [2020-07-29 03:18:23,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:18:23,060 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:23,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. cyclomatic complexity: 30 [2020-07-29 03:18:23,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:23,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:23,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:18:23,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:23,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:23,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:23,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 204 transitions. [2020-07-29 03:18:23,075 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:23,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:23,080 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 113 transitions. cyclomatic complexity: 30 [2020-07-29 03:18:23,124 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 62 examples of accepted words. [2020-07-29 03:18:23,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:18:23,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:23,127 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:18:23,127 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 145 states and 204 transitions. cyclomatic complexity: 60 [2020-07-29 03:18:23,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 145 states and 204 transitions. cyclomatic complexity: 60 [2020-07-29 03:18:23,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:23,127 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:18:23,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:23,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:23,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:23,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 145 letters. Loop has 145 letters. [2020-07-29 03:18:23,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 145 letters. Loop has 145 letters. [2020-07-29 03:18:23,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 145 letters. Loop has 145 letters. [2020-07-29 03:18:23,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:18:23,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:18:23,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 84 letters. Loop has 84 letters. [2020-07-29 03:18:23,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:23,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:23,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:23,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:23,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:23,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:23,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:23,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:23,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:23,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 36 letters. Loop has 21 letters. [2020-07-29 03:18:23,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 21 letters. [2020-07-29 03:18:23,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 36 letters. Loop has 21 letters. [2020-07-29 03:18:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:23,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:23,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:23,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 33 letters. Loop has 22 letters. [2020-07-29 03:18:23,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 22 letters. [2020-07-29 03:18:23,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 33 letters. Loop has 22 letters. [2020-07-29 03:18:23,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 21 letters. [2020-07-29 03:18:23,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 21 letters. [2020-07-29 03:18:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 51 letters. Loop has 21 letters. [2020-07-29 03:18:23,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 52 letters. Loop has 21 letters. [2020-07-29 03:18:23,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 21 letters. [2020-07-29 03:18:23,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 52 letters. Loop has 21 letters. [2020-07-29 03:18:23,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:23,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:23,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:23,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 21 letters. [2020-07-29 03:18:23,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 21 letters. [2020-07-29 03:18:23,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 26 letters. Loop has 21 letters. [2020-07-29 03:18:23,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:23,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:23,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:23,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 22 letters. [2020-07-29 03:18:23,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 22 letters. [2020-07-29 03:18:23,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 25 letters. Loop has 22 letters. [2020-07-29 03:18:23,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 48 letters. Loop has 21 letters. [2020-07-29 03:18:23,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 21 letters. [2020-07-29 03:18:23,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 48 letters. Loop has 21 letters. [2020-07-29 03:18:23,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:23,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:23,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:23,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:23,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:23,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:23,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:23,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:23,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:23,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:23,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:23,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:23,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:23,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:23,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 44 letters. Loop has 21 letters. [2020-07-29 03:18:23,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 21 letters. [2020-07-29 03:18:23,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 44 letters. Loop has 21 letters. [2020-07-29 03:18:23,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 22 letters. [2020-07-29 03:18:23,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 22 letters. [2020-07-29 03:18:23,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 22 letters. [2020-07-29 03:18:23,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:23,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:23,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:23,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:23,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 53 letters. Loop has 21 letters. [2020-07-29 03:18:23,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 57 letters. Loop has 21 letters. [2020-07-29 03:18:23,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 21 letters. [2020-07-29 03:18:23,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 57 letters. Loop has 21 letters. [2020-07-29 03:18:23,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:18:23,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:18:23,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:18:23,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 26 letters. Loop has 23 letters. [2020-07-29 03:18:23,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 26 letters. Loop has 23 letters. [2020-07-29 03:18:23,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 26 letters. Loop has 23 letters. [2020-07-29 03:18:23,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:23,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:23,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:23,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:23,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:23,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:23,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:23,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:23,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:23,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:23,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:23,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 32 letters. Loop has 21 letters. [2020-07-29 03:18:23,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 56 letters. Loop has 21 letters. [2020-07-29 03:18:23,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 21 letters. [2020-07-29 03:18:23,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 56 letters. Loop has 21 letters. [2020-07-29 03:18:23,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 55 letters. Loop has 21 letters. [2020-07-29 03:18:23,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 21 letters. [2020-07-29 03:18:23,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 55 letters. Loop has 21 letters. [2020-07-29 03:18:23,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:23,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:23,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:23,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:23,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:23,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 21 letters. [2020-07-29 03:18:23,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 54 letters. Loop has 22 letters. [2020-07-29 03:18:23,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 22 letters. [2020-07-29 03:18:23,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 54 letters. Loop has 22 letters. [2020-07-29 03:18:23,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 55 letters. Loop has 23 letters. [2020-07-29 03:18:23,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 23 letters. [2020-07-29 03:18:23,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 55 letters. Loop has 23 letters. [2020-07-29 03:18:23,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 31 letters. Loop has 21 letters. [2020-07-29 03:18:23,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 21 letters. [2020-07-29 03:18:23,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 31 letters. Loop has 21 letters. [2020-07-29 03:18:23,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 30 letters. Loop has 21 letters. [2020-07-29 03:18:23,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 21 letters. [2020-07-29 03:18:23,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 30 letters. Loop has 21 letters. [2020-07-29 03:18:23,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:23,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:23,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:23,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:23,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:23,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 29 letters. Loop has 21 letters. [2020-07-29 03:18:23,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:18:23,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:18:23,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:18:23,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:23,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:23,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:23,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 29 letters. Loop has 22 letters. [2020-07-29 03:18:23,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 29 letters. Loop has 22 letters. [2020-07-29 03:18:23,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 29 letters. Loop has 22 letters. [2020-07-29 03:18:23,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:23,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:23,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 28 letters. Loop has 21 letters. [2020-07-29 03:18:23,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 27 letters. Loop has 21 letters. [2020-07-29 03:18:23,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 27 letters. Loop has 21 letters. [2020-07-29 03:18:23,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 27 letters. Loop has 21 letters. [2020-07-29 03:18:23,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:23,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:23,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 25 letters. Loop has 21 letters. [2020-07-29 03:18:23,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:23,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:23,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 24 letters. Loop has 21 letters. [2020-07-29 03:18:23,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 23 letters. Loop has 21 letters. [2020-07-29 03:18:23,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 21 letters. [2020-07-29 03:18:23,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 23 letters. Loop has 21 letters. [2020-07-29 03:18:23,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:23,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:23,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 42 letters. Loop has 21 letters. [2020-07-29 03:18:23,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:23,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:23,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 41 letters. Loop has 21 letters. [2020-07-29 03:18:23,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:23,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:23,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 40 letters. Loop has 21 letters. [2020-07-29 03:18:23,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:23,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:23,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 39 letters. Loop has 21 letters. [2020-07-29 03:18:23,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 46 letters. Loop has 21 letters. [2020-07-29 03:18:23,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 21 letters. [2020-07-29 03:18:23,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 46 letters. Loop has 21 letters. [2020-07-29 03:18:23,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 47 letters. Loop has 21 letters. [2020-07-29 03:18:23,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 21 letters. [2020-07-29 03:18:23,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 47 letters. Loop has 21 letters. [2020-07-29 03:18:23,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 45 letters. Loop has 21 letters. [2020-07-29 03:18:23,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 21 letters. [2020-07-29 03:18:23,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 45 letters. Loop has 21 letters. [2020-07-29 03:18:23,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:23,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:23,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 37 letters. Loop has 21 letters. [2020-07-29 03:18:23,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:23,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:23,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 38 letters. Loop has 21 letters. [2020-07-29 03:18:23,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:18:23,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:18:23,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:18:23,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:23,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:23,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 33 letters. Loop has 21 letters. [2020-07-29 03:18:23,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 34 letters. Loop has 21 letters. [2020-07-29 03:18:23,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 21 letters. [2020-07-29 03:18:23,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 34 letters. Loop has 21 letters. [2020-07-29 03:18:23,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 35 letters. Loop has 21 letters. [2020-07-29 03:18:23,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 21 letters. [2020-07-29 03:18:23,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 35 letters. Loop has 21 letters. [2020-07-29 03:18:23,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:23,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:23,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 49 letters. Loop has 21 letters. [2020-07-29 03:18:23,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:23,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:23,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 50 letters. Loop has 21 letters. [2020-07-29 03:18:23,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 113 transitions. cyclomatic complexity: 30 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:23,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:23,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 145 states and 204 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:23,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,263 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:18:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-07-29 03:18:23,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-07-29 03:18:23,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-07-29 03:18:23,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-07-29 03:18:23,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:23,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. cyclomatic complexity: 60 [2020-07-29 03:18:23,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:23,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-07-29 03:18:23,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:23,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:23,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:23,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:23,276 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:23,276 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:23,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:23,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:23,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:23,277 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:18:23,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:23,278 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:18:23,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:18:23,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:23,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:23,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:18:23,346 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:23,347 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:18:23,347 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:23,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:23,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:23,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:23,347 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:23,347 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:23,347 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:23,347 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:18:23,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:18:23,348 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:23,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:23,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:18:23 BoogieIcfgContainer [2020-07-29 03:18:23,358 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:18:23,359 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:18:23,359 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:18:23,359 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:18:23,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:16" (3/4) ... [2020-07-29 03:18:23,364 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:18:23,364 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:18:23,373 INFO L168 Benchmark]: Toolchain (without parser) took 7902.71 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 956.2 MB in the beginning and 1.2 GB in the end (delta: -199.3 MB). Peak memory consumption was 131.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:23,375 INFO L168 Benchmark]: CDTParser took 0.25 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 03:18:23,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:23,383 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:23,383 INFO L168 Benchmark]: Boogie Preprocessor took 38.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:23,384 INFO L168 Benchmark]: RCFGBuilder took 673.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:23,385 INFO L168 Benchmark]: BuchiAutomizer took 6684.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.7 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:23,385 INFO L168 Benchmark]: Witness Printer took 5.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:23,394 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.25 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 438.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -172.9 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 673.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6684.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.8 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.7 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.81 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 170 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital124 mio100 ax129 hnf106 lsp22 ukn100 mio100 lsp100 div168 bol100 ite100 ukn100 eq153 hnf75 smp100 dnf104 smp96 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...