./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.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.5.1.ufo.BOUNDED-10.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 3b58827e5cb113f4933fbecb5318cb7f1c057b47 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:18:38,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:18:38,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:18:38,224 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:18:38,225 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:18:38,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:18:38,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:18:38,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:18:38,232 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:18:38,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:18:38,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:18:38,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:18:38,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:18:38,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:18:38,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:18:38,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:18:38,242 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:18:38,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:18:38,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:18:38,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:18:38,249 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:18:38,250 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:18:38,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:18:38,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:18:38,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:18:38,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:18:38,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:18:38,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:18:38,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:18:38,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:18:38,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:18:38,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:18:38,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:18:38,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:18:38,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:18:38,262 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:18:38,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:18:38,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:18:38,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:18:38,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:18:38,265 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:38,283 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:18:38,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:18:38,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:18:38,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:18:38,285 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:18:38,286 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:18:38,286 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:18:38,286 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:18:38,286 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:18:38,287 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:18:38,287 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:18:38,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:18:38,287 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:18:38,288 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:18:38,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:18:38,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:18:38,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:18:38,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:18:38,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:18:38,289 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:18:38,290 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:18:38,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:18:38,290 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:18:38,290 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:18:38,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:18:38,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:18:38,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:18:38,292 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:18:38,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:18:38,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:18:38,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:18:38,293 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:18:38,294 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:18:38,294 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 -> 3b58827e5cb113f4933fbecb5318cb7f1c057b47 [2020-07-29 03:18:38,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:18:38,599 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:18:38,603 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:18:38,605 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:18:38,605 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:18:38,606 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2020-07-29 03:18:38,688 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc360bd9/d6ff95e593074894b335e0b0a20f329b/FLAGd51e996ac [2020-07-29 03:18:39,199 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:18:39,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2020-07-29 03:18:39,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc360bd9/d6ff95e593074894b335e0b0a20f329b/FLAGd51e996ac [2020-07-29 03:18:39,550 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffc360bd9/d6ff95e593074894b335e0b0a20f329b [2020-07-29 03:18:39,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:18:39,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:18:39,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:39,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:18:39,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:18:39,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:39" (1/1) ... [2020-07-29 03:18:39,569 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d9ae94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:39, skipping insertion in model container [2020-07-29 03:18:39,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:18:39" (1/1) ... [2020-07-29 03:18:39,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:18:39,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:18:39,861 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:39,872 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:18:40,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:18:40,045 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:18:40,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:40 WrapperNode [2020-07-29 03:18:40,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:18:40,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:40,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:18:40,047 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:18:40,053 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:40" (1/1) ... [2020-07-29 03:18:40,063 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:40" (1/1) ... [2020-07-29 03:18:40,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:18:40,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:18:40,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:18:40,118 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:18:40,131 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:40" (1/1) ... [2020-07-29 03:18:40,132 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:40" (1/1) ... [2020-07-29 03:18:40,135 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:40" (1/1) ... [2020-07-29 03:18:40,135 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:40" (1/1) ... [2020-07-29 03:18:40,145 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:40" (1/1) ... [2020-07-29 03:18:40,154 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:40" (1/1) ... [2020-07-29 03:18:40,157 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:40" (1/1) ... [2020-07-29 03:18:40,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:18:40,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:18:40,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:18:40,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:18:40,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:40" (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:40,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:18:40,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:18:41,098 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:18:41,098 INFO L295 CfgBuilder]: Removed 23 assume(true) statements. [2020-07-29 03:18:41,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:41 BoogieIcfgContainer [2020-07-29 03:18:41,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:18:41,104 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:18:41,104 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:18:41,108 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:18:41,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:41,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:18:39" (1/3) ... [2020-07-29 03:18:41,110 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ffc7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:41, skipping insertion in model container [2020-07-29 03:18:41,111 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:41,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:18:40" (2/3) ... [2020-07-29 03:18:41,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@63ffc7e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:41, skipping insertion in model container [2020-07-29 03:18:41,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:41,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:41" (3/3) ... [2020-07-29 03:18:41,114 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2020-07-29 03:18:41,159 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:18:41,160 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:18:41,160 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:18:41,160 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:18:41,161 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:18:41,161 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:18:41,161 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:18:41,161 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:18:41,177 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states. [2020-07-29 03:18:41,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2020-07-29 03:18:41,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:41,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:41,232 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:41,232 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, 1, 1, 1, 1, 1] [2020-07-29 03:18:41,232 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:18:41,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states. [2020-07-29 03:18:41,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2020-07-29 03:18:41,251 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:41,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:41,253 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:41,253 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, 1, 1, 1, 1, 1] [2020-07-29 03:18:41,261 INFO L794 eck$LassoCheckResult]: Stem: 45#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 18#L-1true havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 44#L245true assume !(0 == ~r1~0);init_~tmp~0 := 0; 16#L245-1true init_#res := init_~tmp~0; 50#L370true main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 76#L67true assume !(0 == assume_abort_if_not_~cond); 52#L66true ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 6#L442-2true [2020-07-29 03:18:41,263 INFO L796 eck$LassoCheckResult]: Loop: 6#L442-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 86#L116true 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 26#L120true assume !(node1_~m1~0 != ~nomsg~0); 22#L120-1true ~mode1~0 := 0; 83#L116-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 63#L144true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 40#L147true assume !(node2_~m2~0 != ~nomsg~0); 37#L147-1true ~mode2~0 := 0; 77#L144-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 42#L169true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 51#L172true assume !(node3_~m3~0 != ~nomsg~0); 48#L172-1true ~mode3~0 := 0; 36#L169-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 55#L194true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 3#L197true assume !(node4_~m4~0 != ~nomsg~0); 31#L197-1true ~mode4~0 := 0; 47#L194-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 8#L219true assume !(0 != ~mode5~0 % 256); 66#L232true assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 65#L232-2true ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 30#L219-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 78#L378true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 61#L378-1true check_#res := check_~tmp~1; 4#L398true main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 34#L472true assume !(0 == assert_~arg % 256); 88#L467true main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 6#L442-2true [2020-07-29 03:18:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:41,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2020-07-29 03:18:41,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:41,280 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978218711] [2020-07-29 03:18:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:41,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:41,599 INFO L280 TraceCheckUtils]: 0: Hoare triple {96#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {96#true} is VALID [2020-07-29 03:18:41,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#true} havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {96#true} is VALID [2020-07-29 03:18:41,601 INFO L280 TraceCheckUtils]: 2: Hoare triple {96#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {98#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:18:41,603 INFO L280 TraceCheckUtils]: 3: Hoare triple {98#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {99#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:18:41,604 INFO L280 TraceCheckUtils]: 4: Hoare triple {99#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {100#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:18:41,605 INFO L280 TraceCheckUtils]: 5: Hoare triple {100#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {97#false} is VALID [2020-07-29 03:18:41,606 INFO L280 TraceCheckUtils]: 6: Hoare triple {97#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {97#false} is VALID [2020-07-29 03:18:41,609 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:41,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978218711] [2020-07-29 03:18:41,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:41,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:41,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381519977] [2020-07-29 03:18:41,618 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:18:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash -911289424, now seen corresponding path program 1 times [2020-07-29 03:18:41,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:41,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934544821] [2020-07-29 03:18:41,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:41,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:41,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {101#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,808 INFO L280 TraceCheckUtils]: 1: Hoare triple {101#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,809 INFO L280 TraceCheckUtils]: 2: Hoare triple {101#true} assume !(node1_~m1~0 != ~nomsg~0); {101#true} is VALID [2020-07-29 03:18:41,809 INFO L280 TraceCheckUtils]: 3: Hoare triple {101#true} ~mode1~0 := 0; {101#true} is VALID [2020-07-29 03:18:41,809 INFO L280 TraceCheckUtils]: 4: Hoare triple {101#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,810 INFO L280 TraceCheckUtils]: 5: Hoare triple {101#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,810 INFO L280 TraceCheckUtils]: 6: Hoare triple {101#true} assume !(node2_~m2~0 != ~nomsg~0); {101#true} is VALID [2020-07-29 03:18:41,810 INFO L280 TraceCheckUtils]: 7: Hoare triple {101#true} ~mode2~0 := 0; {101#true} is VALID [2020-07-29 03:18:41,811 INFO L280 TraceCheckUtils]: 8: Hoare triple {101#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,811 INFO L280 TraceCheckUtils]: 9: Hoare triple {101#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,811 INFO L280 TraceCheckUtils]: 10: Hoare triple {101#true} assume !(node3_~m3~0 != ~nomsg~0); {101#true} is VALID [2020-07-29 03:18:41,812 INFO L280 TraceCheckUtils]: 11: Hoare triple {101#true} ~mode3~0 := 0; {101#true} is VALID [2020-07-29 03:18:41,812 INFO L280 TraceCheckUtils]: 12: Hoare triple {101#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,813 INFO L280 TraceCheckUtils]: 13: Hoare triple {101#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,813 INFO L280 TraceCheckUtils]: 14: Hoare triple {101#true} assume !(node4_~m4~0 != ~nomsg~0); {101#true} is VALID [2020-07-29 03:18:41,813 INFO L280 TraceCheckUtils]: 15: Hoare triple {101#true} ~mode4~0 := 0; {101#true} is VALID [2020-07-29 03:18:41,814 INFO L280 TraceCheckUtils]: 16: Hoare triple {101#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {101#true} is VALID [2020-07-29 03:18:41,814 INFO L280 TraceCheckUtils]: 17: Hoare triple {101#true} assume !(0 != ~mode5~0 % 256); {101#true} is VALID [2020-07-29 03:18:41,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {101#true} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; {101#true} is VALID [2020-07-29 03:18:41,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {101#true} ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; {101#true} is VALID [2020-07-29 03:18:41,815 INFO L280 TraceCheckUtils]: 20: Hoare triple {101#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {101#true} is VALID [2020-07-29 03:18:41,817 INFO L280 TraceCheckUtils]: 21: Hoare triple {101#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {103#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:41,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {103#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {104#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:41,820 INFO L280 TraceCheckUtils]: 23: Hoare triple {104#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {105#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:41,821 INFO L280 TraceCheckUtils]: 24: Hoare triple {105#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {102#false} is VALID [2020-07-29 03:18:41,822 INFO L280 TraceCheckUtils]: 25: Hoare triple {102#false} main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; {102#false} is VALID [2020-07-29 03:18:41,825 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:41,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934544821] [2020-07-29 03:18:41,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:41,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:41,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458269396] [2020-07-29 03:18:41,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:41,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:41,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:41,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:41,848 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2020-07-29 03:18:42,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:42,376 INFO L93 Difference]: Finished difference Result 95 states and 155 transitions. [2020-07-29 03:18:42,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:42,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:42,396 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:42,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 155 transitions. [2020-07-29 03:18:42,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-07-29 03:18:42,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 87 states and 117 transitions. [2020-07-29 03:18:42,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-07-29 03:18:42,419 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-07-29 03:18:42,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2020-07-29 03:18:42,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:42,421 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2020-07-29 03:18:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2020-07-29 03:18:42,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-29 03:18:42,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:42,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 117 transitions. Second operand 87 states. [2020-07-29 03:18:42,460 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 117 transitions. Second operand 87 states. [2020-07-29 03:18:42,462 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand 87 states. [2020-07-29 03:18:42,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:42,468 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2020-07-29 03:18:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2020-07-29 03:18:42,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:42,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:42,471 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states and 117 transitions. [2020-07-29 03:18:42,471 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states and 117 transitions. [2020-07-29 03:18:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:42,477 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2020-07-29 03:18:42,477 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2020-07-29 03:18:42,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:42,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:42,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:42,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-29 03:18:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2020-07-29 03:18:42,487 INFO L711 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2020-07-29 03:18:42,487 INFO L591 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2020-07-29 03:18:42,487 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:18:42,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2020-07-29 03:18:42,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-07-29 03:18:42,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:42,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:42,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:42,492 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, 1, 1, 1, 1, 1] [2020-07-29 03:18:42,493 INFO L794 eck$LassoCheckResult]: Stem: 269#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 232#L-1 havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 233#L245 assume 0 == ~r1~0; 268#L246 assume ~id1~0 >= 0; 287#L247 assume 0 == ~st1~0; 245#L248 assume ~send1~0 == ~id1~0; 246#L249 assume 0 == ~mode1~0 % 256; 277#L250 assume ~id2~0 >= 0; 280#L251 assume 0 == ~st2~0; 221#L252 assume ~send2~0 == ~id2~0; 222#L253 assume 0 == ~mode2~0 % 256; 261#L254 assume ~id3~0 >= 0; 234#L255 assume 0 == ~st3~0; 235#L256 assume ~send3~0 == ~id3~0; 270#L257 assume 0 == ~mode3~0 % 256; 288#L258 assume ~id4~0 >= 0; 247#L259 assume 0 == ~st4~0; 248#L260 assume ~send4~0 == ~id4~0; 278#L261 assume 0 == ~mode4~0 % 256; 281#L262 assume ~id5~0 >= 0; 223#L263 assume 0 == ~st5~0; 224#L264 assume ~send5~0 == ~id5~0; 262#L265 assume 0 == ~mode5~0 % 256; 236#L266 assume ~id1~0 != ~id2~0; 237#L267 assume ~id1~0 != ~id3~0; 271#L268 assume ~id1~0 != ~id4~0; 289#L269 assume ~id1~0 != ~id5~0; 249#L270 assume ~id2~0 != ~id3~0; 250#L271 assume ~id2~0 != ~id4~0; 254#L272 assume ~id2~0 != ~id5~0; 282#L273 assume ~id3~0 != ~id4~0; 225#L274 assume ~id3~0 != ~id5~0; 226#L275 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 229#L245-1 init_#res := init_~tmp~0; 230#L370 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 272#L67 assume !(0 == assume_abort_if_not_~cond); 274#L66 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 212#L442-2 [2020-07-29 03:18:42,494 INFO L796 eck$LassoCheckResult]: Loop: 212#L442-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 213#L116 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 243#L120 assume !(node1_~m1~0 != ~nomsg~0); 220#L120-1 ~mode1~0 := 0; 240#L116-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 283#L144 assume !(0 != ~mode2~0 % 256); 227#L157 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 214#L157-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; 215#L144-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 265#L169 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 266#L172 assume !(node3_~m3~0 != ~nomsg~0); 256#L172-1 ~mode3~0 := 0; 258#L169-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 259#L194 assume !(0 != ~mode4~0 % 256); 276#L207 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 291#L207-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 253#L194-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 216#L219 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 217#L222 assume !(node5_~m5~0 != ~nomsg~0); 242#L222-1 ~mode5~0 := 0; 251#L219-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 252#L378 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 211#L378-1 check_#res := check_~tmp~1; 208#L398 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 209#L472 assume !(0 == assert_~arg % 256); 257#L467 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 212#L442-2 [2020-07-29 03:18:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2020-07-29 03:18:42,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:42,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410292241] [2020-07-29 03:18:42,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:42,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:42,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:42,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash 563454758, now seen corresponding path program 1 times [2020-07-29 03:18:42,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:42,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004135901] [2020-07-29 03:18:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:42,735 INFO L280 TraceCheckUtils]: 0: Hoare triple {471#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,735 INFO L280 TraceCheckUtils]: 1: Hoare triple {471#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,736 INFO L280 TraceCheckUtils]: 2: Hoare triple {471#true} assume !(node1_~m1~0 != ~nomsg~0); {471#true} is VALID [2020-07-29 03:18:42,736 INFO L280 TraceCheckUtils]: 3: Hoare triple {471#true} ~mode1~0 := 0; {471#true} is VALID [2020-07-29 03:18:42,737 INFO L280 TraceCheckUtils]: 4: Hoare triple {471#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {471#true} assume !(0 != ~mode2~0 % 256); {471#true} is VALID [2020-07-29 03:18:42,737 INFO L280 TraceCheckUtils]: 6: Hoare triple {471#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {471#true} is VALID [2020-07-29 03:18:42,738 INFO L280 TraceCheckUtils]: 7: Hoare triple {471#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; {471#true} is VALID [2020-07-29 03:18:42,738 INFO L280 TraceCheckUtils]: 8: Hoare triple {471#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,738 INFO L280 TraceCheckUtils]: 9: Hoare triple {471#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,739 INFO L280 TraceCheckUtils]: 10: Hoare triple {471#true} assume !(node3_~m3~0 != ~nomsg~0); {471#true} is VALID [2020-07-29 03:18:42,739 INFO L280 TraceCheckUtils]: 11: Hoare triple {471#true} ~mode3~0 := 0; {471#true} is VALID [2020-07-29 03:18:42,739 INFO L280 TraceCheckUtils]: 12: Hoare triple {471#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,740 INFO L280 TraceCheckUtils]: 13: Hoare triple {471#true} assume !(0 != ~mode4~0 % 256); {471#true} is VALID [2020-07-29 03:18:42,740 INFO L280 TraceCheckUtils]: 14: Hoare triple {471#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; {471#true} is VALID [2020-07-29 03:18:42,741 INFO L280 TraceCheckUtils]: 15: Hoare triple {471#true} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {471#true} is VALID [2020-07-29 03:18:42,741 INFO L280 TraceCheckUtils]: 16: Hoare triple {471#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,741 INFO L280 TraceCheckUtils]: 17: Hoare triple {471#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {471#true} is VALID [2020-07-29 03:18:42,742 INFO L280 TraceCheckUtils]: 18: Hoare triple {471#true} assume !(node5_~m5~0 != ~nomsg~0); {471#true} is VALID [2020-07-29 03:18:42,742 INFO L280 TraceCheckUtils]: 19: Hoare triple {471#true} ~mode5~0 := 0; {471#true} is VALID [2020-07-29 03:18:42,743 INFO L280 TraceCheckUtils]: 20: Hoare triple {471#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {471#true} is VALID [2020-07-29 03:18:42,744 INFO L280 TraceCheckUtils]: 21: Hoare triple {471#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; {473#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:42,745 INFO L280 TraceCheckUtils]: 22: Hoare triple {473#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {474#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:42,746 INFO L280 TraceCheckUtils]: 23: Hoare triple {474#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {475#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:42,747 INFO L280 TraceCheckUtils]: 24: Hoare triple {475#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {472#false} is VALID [2020-07-29 03:18:42,748 INFO L280 TraceCheckUtils]: 25: Hoare triple {472#false} main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; {472#false} is VALID [2020-07-29 03:18:42,750 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:42,750 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004135901] [2020-07-29 03:18:42,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:42,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:42,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611967370] [2020-07-29 03:18:42,752 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:42,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:42,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:42,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:42,753 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand 5 states. [2020-07-29 03:18:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:43,182 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2020-07-29 03:18:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:43,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:43,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:43,226 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2020-07-29 03:18:43,232 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-07-29 03:18:43,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2020-07-29 03:18:43,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2020-07-29 03:18:43,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2020-07-29 03:18:43,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2020-07-29 03:18:43,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:43,238 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-07-29 03:18:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2020-07-29 03:18:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-07-29 03:18:43,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:43,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 114 transitions. Second operand 87 states. [2020-07-29 03:18:43,250 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 114 transitions. Second operand 87 states. [2020-07-29 03:18:43,250 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand 87 states. [2020-07-29 03:18:43,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:43,260 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2020-07-29 03:18:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2020-07-29 03:18:43,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:43,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:43,268 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 87 states and 114 transitions. [2020-07-29 03:18:43,268 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 87 states and 114 transitions. [2020-07-29 03:18:43,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:43,274 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2020-07-29 03:18:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2020-07-29 03:18:43,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:43,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:43,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:43,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:43,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-29 03:18:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2020-07-29 03:18:43,279 INFO L711 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-07-29 03:18:43,279 INFO L591 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-07-29 03:18:43,279 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:18:43,280 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2020-07-29 03:18:43,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2020-07-29 03:18:43,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:43,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:43,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:43,293 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, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:43,294 INFO L794 eck$LassoCheckResult]: Stem: 634#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 597#L-1 havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 598#L245 assume 0 == ~r1~0; 633#L246 assume ~id1~0 >= 0; 652#L247 assume 0 == ~st1~0; 610#L248 assume ~send1~0 == ~id1~0; 611#L249 assume 0 == ~mode1~0 % 256; 642#L250 assume ~id2~0 >= 0; 645#L251 assume 0 == ~st2~0; 586#L252 assume ~send2~0 == ~id2~0; 587#L253 assume 0 == ~mode2~0 % 256; 626#L254 assume ~id3~0 >= 0; 599#L255 assume 0 == ~st3~0; 600#L256 assume ~send3~0 == ~id3~0; 635#L257 assume 0 == ~mode3~0 % 256; 653#L258 assume ~id4~0 >= 0; 612#L259 assume 0 == ~st4~0; 613#L260 assume ~send4~0 == ~id4~0; 644#L261 assume 0 == ~mode4~0 % 256; 646#L262 assume ~id5~0 >= 0; 588#L263 assume 0 == ~st5~0; 589#L264 assume ~send5~0 == ~id5~0; 627#L265 assume 0 == ~mode5~0 % 256; 601#L266 assume ~id1~0 != ~id2~0; 602#L267 assume ~id1~0 != ~id3~0; 636#L268 assume ~id1~0 != ~id4~0; 654#L269 assume ~id1~0 != ~id5~0; 614#L270 assume ~id2~0 != ~id3~0; 615#L271 assume ~id2~0 != ~id4~0; 619#L272 assume ~id2~0 != ~id5~0; 648#L273 assume ~id3~0 != ~id4~0; 590#L274 assume ~id3~0 != ~id5~0; 591#L275 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 595#L245-1 init_#res := init_~tmp~0; 596#L370 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 637#L67 assume !(0 == assume_abort_if_not_~cond); 639#L66 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 577#L442-2 [2020-07-29 03:18:43,295 INFO L796 eck$LassoCheckResult]: Loop: 577#L442-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 578#L116 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 608#L120 assume !(node1_~m1~0 != ~nomsg~0); 585#L120-1 ~mode1~0 := 0; 605#L116-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 647#L144 assume !(0 != ~mode2~0 % 256); 592#L157 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 579#L157-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; 580#L144-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 630#L169 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 631#L172 assume !(node3_~m3~0 != ~nomsg~0); 621#L172-1 ~mode3~0 := 0; 623#L169-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 624#L194 assume !(0 != ~mode4~0 % 256); 641#L207 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 656#L207-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 618#L194-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 581#L219 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 582#L222 assume !(node5_~m5~0 != ~nomsg~0); 607#L222-1 ~mode5~0 := 0; 616#L219-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 617#L378 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 655#L379 assume ~r1~0 >= 5; 594#L383 assume ~r1~0 < 5;check_~tmp~1 := 1; 576#L378-1 check_#res := check_~tmp~1; 573#L398 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 574#L472 assume !(0 == assert_~arg % 256); 622#L467 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 577#L442-2 [2020-07-29 03:18:43,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:43,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2020-07-29 03:18:43,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:43,298 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057264466] [2020-07-29 03:18:43,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:43,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:43,374 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:43,394 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:43,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1101675498, now seen corresponding path program 1 times [2020-07-29 03:18:43,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:43,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326381621] [2020-07-29 03:18:43,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:43,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:43,491 INFO L280 TraceCheckUtils]: 0: Hoare triple {836#true} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {836#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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {836#true} assume !(node1_~m1~0 != ~nomsg~0); {836#true} is VALID [2020-07-29 03:18:43,492 INFO L280 TraceCheckUtils]: 3: Hoare triple {836#true} ~mode1~0 := 0; {836#true} is VALID [2020-07-29 03:18:43,492 INFO L280 TraceCheckUtils]: 4: Hoare triple {836#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,493 INFO L280 TraceCheckUtils]: 5: Hoare triple {836#true} assume !(0 != ~mode2~0 % 256); {836#true} is VALID [2020-07-29 03:18:43,493 INFO L280 TraceCheckUtils]: 6: Hoare triple {836#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {836#true} is VALID [2020-07-29 03:18:43,496 INFO L280 TraceCheckUtils]: 7: Hoare triple {836#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; {836#true} is VALID [2020-07-29 03:18:43,497 INFO L280 TraceCheckUtils]: 8: Hoare triple {836#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,497 INFO L280 TraceCheckUtils]: 9: Hoare triple {836#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,497 INFO L280 TraceCheckUtils]: 10: Hoare triple {836#true} assume !(node3_~m3~0 != ~nomsg~0); {836#true} is VALID [2020-07-29 03:18:43,498 INFO L280 TraceCheckUtils]: 11: Hoare triple {836#true} ~mode3~0 := 0; {836#true} is VALID [2020-07-29 03:18:43,498 INFO L280 TraceCheckUtils]: 12: Hoare triple {836#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,498 INFO L280 TraceCheckUtils]: 13: Hoare triple {836#true} assume !(0 != ~mode4~0 % 256); {836#true} is VALID [2020-07-29 03:18:43,499 INFO L280 TraceCheckUtils]: 14: Hoare triple {836#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; {836#true} is VALID [2020-07-29 03:18:43,499 INFO L280 TraceCheckUtils]: 15: Hoare triple {836#true} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {836#true} is VALID [2020-07-29 03:18:43,499 INFO L280 TraceCheckUtils]: 16: Hoare triple {836#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {836#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {836#true} is VALID [2020-07-29 03:18:43,500 INFO L280 TraceCheckUtils]: 18: Hoare triple {836#true} assume !(node5_~m5~0 != ~nomsg~0); {836#true} is VALID [2020-07-29 03:18:43,501 INFO L280 TraceCheckUtils]: 19: Hoare triple {836#true} ~mode5~0 := 0; {836#true} is VALID [2020-07-29 03:18:43,501 INFO L280 TraceCheckUtils]: 20: Hoare triple {836#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {836#true} is VALID [2020-07-29 03:18:43,501 INFO L280 TraceCheckUtils]: 21: Hoare triple {836#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {836#true} is VALID [2020-07-29 03:18:43,503 INFO L280 TraceCheckUtils]: 22: Hoare triple {836#true} assume ~r1~0 >= 5; {838#(< 4 ~r1~0)} is VALID [2020-07-29 03:18:43,504 INFO L280 TraceCheckUtils]: 23: Hoare triple {838#(< 4 ~r1~0)} assume ~r1~0 < 5;check_~tmp~1 := 1; {837#false} is VALID [2020-07-29 03:18:43,504 INFO L280 TraceCheckUtils]: 24: Hoare triple {837#false} check_#res := check_~tmp~1; {837#false} is VALID [2020-07-29 03:18:43,505 INFO L280 TraceCheckUtils]: 25: Hoare triple {837#false} main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {837#false} is VALID [2020-07-29 03:18:43,505 INFO L280 TraceCheckUtils]: 26: Hoare triple {837#false} assume !(0 == assert_~arg % 256); {837#false} is VALID [2020-07-29 03:18:43,506 INFO L280 TraceCheckUtils]: 27: Hoare triple {837#false} main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; {837#false} is VALID [2020-07-29 03:18:43,507 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:43,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326381621] [2020-07-29 03:18:43,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:43,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:43,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302629747] [2020-07-29 03:18:43,509 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:43,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:43,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:43,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:43,510 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand 3 states. [2020-07-29 03:18:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:43,775 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2020-07-29 03:18:43,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:18:43,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:43,804 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:43,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2020-07-29 03:18:43,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-07-29 03:18:43,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2020-07-29 03:18:43,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2020-07-29 03:18:43,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2020-07-29 03:18:43,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2020-07-29 03:18:43,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:43,817 INFO L688 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2020-07-29 03:18:43,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2020-07-29 03:18:43,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2020-07-29 03:18:43,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:43,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states and 180 transitions. Second operand 131 states. [2020-07-29 03:18:43,824 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states and 180 transitions. Second operand 131 states. [2020-07-29 03:18:43,824 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. Second operand 131 states. [2020-07-29 03:18:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:43,828 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2020-07-29 03:18:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2020-07-29 03:18:43,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:43,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:43,829 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 131 states and 180 transitions. [2020-07-29 03:18:43,829 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 131 states and 180 transitions. [2020-07-29 03:18:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:43,834 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2020-07-29 03:18:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2020-07-29 03:18:43,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:43,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:43,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:43,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-29 03:18:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2020-07-29 03:18:43,839 INFO L711 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2020-07-29 03:18:43,839 INFO L591 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2020-07-29 03:18:43,839 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:18:43,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2020-07-29 03:18:43,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-07-29 03:18:43,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:43,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:43,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:43,842 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:43,842 INFO L794 eck$LassoCheckResult]: Stem: 1034#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; 997#L-1 havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 998#L245 assume 0 == ~r1~0; 1033#L246 assume ~id1~0 >= 0; 1055#L247 assume 0 == ~st1~0; 1008#L248 assume ~send1~0 == ~id1~0; 1009#L249 assume 0 == ~mode1~0 % 256; 1043#L250 assume ~id2~0 >= 0; 1046#L251 assume 0 == ~st2~0; 984#L252 assume ~send2~0 == ~id2~0; 985#L253 assume 0 == ~mode2~0 % 256; 1026#L254 assume ~id3~0 >= 0; 999#L255 assume 0 == ~st3~0; 1000#L256 assume ~send3~0 == ~id3~0; 1035#L257 assume 0 == ~mode3~0 % 256; 1056#L258 assume ~id4~0 >= 0; 1012#L259 assume 0 == ~st4~0; 1013#L260 assume ~send4~0 == ~id4~0; 1044#L261 assume 0 == ~mode4~0 % 256; 1048#L262 assume ~id5~0 >= 0; 988#L263 assume 0 == ~st5~0; 989#L264 assume ~send5~0 == ~id5~0; 1027#L265 assume 0 == ~mode5~0 % 256; 1001#L266 assume ~id1~0 != ~id2~0; 1002#L267 assume ~id1~0 != ~id3~0; 1037#L268 assume ~id1~0 != ~id4~0; 1057#L269 assume ~id1~0 != ~id5~0; 1014#L270 assume ~id2~0 != ~id3~0; 1015#L271 assume ~id2~0 != ~id4~0; 1019#L272 assume ~id2~0 != ~id5~0; 1049#L273 assume ~id3~0 != ~id4~0; 990#L274 assume ~id3~0 != ~id5~0; 991#L275 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 994#L245-1 init_#res := init_~tmp~0; 995#L370 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1038#L67 assume !(0 == assume_abort_if_not_~cond); 1040#L66 ~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; 977#L442-2 [2020-07-29 03:18:43,843 INFO L796 eck$LassoCheckResult]: Loop: 977#L442-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 978#L116 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1010#L120 assume !(node1_~m1~0 != ~nomsg~0); 987#L120-1 ~mode1~0 := 0; 1005#L116-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1050#L144 assume !(0 != ~mode2~0 % 256); 992#L157 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 979#L157-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; 980#L144-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1030#L169 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1031#L172 assume !(node3_~m3~0 != ~nomsg~0); 1021#L172-1 ~mode3~0 := 0; 1023#L169-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1024#L194 assume !(0 != ~mode4~0 % 256); 1042#L207 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 1059#L207-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 1018#L194-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1069#L219 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1066#L222 assume !(node5_~m5~0 != ~nomsg~0); 1064#L222-1 ~mode5~0 := 0; 1062#L219-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1061#L378 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1060#L379 assume !(~r1~0 >= 5); 1053#L382 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 1054#L383 assume ~r1~0 < 5;check_~tmp~1 := 1; 1047#L378-1 check_#res := check_~tmp~1; 973#L398 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 974#L472 assume !(0 == assert_~arg % 256); 1022#L467 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 977#L442-2 [2020-07-29 03:18:43,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:43,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2020-07-29 03:18:43,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:43,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855805579] [2020-07-29 03:18:43,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:43,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:43,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:43,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1854369915, now seen corresponding path program 1 times [2020-07-29 03:18:43,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:43,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285760604] [2020-07-29 03:18:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:43,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:43,916 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:43,923 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:43,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:43,923 INFO L82 PathProgramCache]: Analyzing trace with hash 55240009, now seen corresponding path program 1 times [2020-07-29 03:18:43,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:43,924 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108031216] [2020-07-29 03:18:43,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:43,986 INFO L280 TraceCheckUtils]: 0: Hoare triple {1370#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {1370#true} is VALID [2020-07-29 03:18:43,987 INFO L280 TraceCheckUtils]: 1: Hoare triple {1370#true} havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1370#true} is VALID [2020-07-29 03:18:43,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {1370#true} assume 0 == ~r1~0; {1370#true} is VALID [2020-07-29 03:18:43,987 INFO L280 TraceCheckUtils]: 3: Hoare triple {1370#true} assume ~id1~0 >= 0; {1370#true} is VALID [2020-07-29 03:18:43,987 INFO L280 TraceCheckUtils]: 4: Hoare triple {1370#true} assume 0 == ~st1~0; {1370#true} is VALID [2020-07-29 03:18:43,987 INFO L280 TraceCheckUtils]: 5: Hoare triple {1370#true} assume ~send1~0 == ~id1~0; {1370#true} is VALID [2020-07-29 03:18:43,989 INFO L280 TraceCheckUtils]: 6: Hoare triple {1370#true} assume 0 == ~mode1~0 % 256; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,990 INFO L280 TraceCheckUtils]: 7: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,992 INFO L280 TraceCheckUtils]: 10: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,992 INFO L280 TraceCheckUtils]: 11: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,993 INFO L280 TraceCheckUtils]: 12: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,993 INFO L280 TraceCheckUtils]: 13: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,994 INFO L280 TraceCheckUtils]: 14: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,994 INFO L280 TraceCheckUtils]: 15: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,995 INFO L280 TraceCheckUtils]: 16: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:43,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,002 INFO L280 TraceCheckUtils]: 18: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,003 INFO L280 TraceCheckUtils]: 19: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,004 INFO L280 TraceCheckUtils]: 20: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,005 INFO L280 TraceCheckUtils]: 21: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,006 INFO L280 TraceCheckUtils]: 22: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,006 INFO L280 TraceCheckUtils]: 23: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,007 INFO L280 TraceCheckUtils]: 24: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,008 INFO L280 TraceCheckUtils]: 25: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,008 INFO L280 TraceCheckUtils]: 26: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,009 INFO L280 TraceCheckUtils]: 27: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,010 INFO L280 TraceCheckUtils]: 28: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,010 INFO L280 TraceCheckUtils]: 29: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,011 INFO L280 TraceCheckUtils]: 30: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,011 INFO L280 TraceCheckUtils]: 31: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,012 INFO L280 TraceCheckUtils]: 32: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,014 INFO L280 TraceCheckUtils]: 33: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,016 INFO L280 TraceCheckUtils]: 34: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,018 INFO L280 TraceCheckUtils]: 35: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,019 INFO L280 TraceCheckUtils]: 36: Hoare triple {1372#(= (* 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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,021 INFO L280 TraceCheckUtils]: 37: Hoare triple {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1372#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:44,023 INFO L280 TraceCheckUtils]: 38: Hoare triple {1372#(= (* 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,023 INFO L280 TraceCheckUtils]: 39: Hoare triple {1371#false} assume !(node1_~m1~0 != ~nomsg~0); {1371#false} is VALID [2020-07-29 03:18:44,023 INFO L280 TraceCheckUtils]: 40: Hoare triple {1371#false} ~mode1~0 := 0; {1371#false} is VALID [2020-07-29 03:18:44,024 INFO L280 TraceCheckUtils]: 41: Hoare triple {1371#false} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,024 INFO L280 TraceCheckUtils]: 42: Hoare triple {1371#false} assume !(0 != ~mode2~0 % 256); {1371#false} is VALID [2020-07-29 03:18:44,024 INFO L280 TraceCheckUtils]: 43: Hoare triple {1371#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {1371#false} is VALID [2020-07-29 03:18:44,025 INFO L280 TraceCheckUtils]: 44: Hoare triple {1371#false} ~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; {1371#false} is VALID [2020-07-29 03:18:44,025 INFO L280 TraceCheckUtils]: 45: Hoare triple {1371#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,025 INFO L280 TraceCheckUtils]: 46: Hoare triple {1371#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,025 INFO L280 TraceCheckUtils]: 47: Hoare triple {1371#false} assume !(node3_~m3~0 != ~nomsg~0); {1371#false} is VALID [2020-07-29 03:18:44,025 INFO L280 TraceCheckUtils]: 48: Hoare triple {1371#false} ~mode3~0 := 0; {1371#false} is VALID [2020-07-29 03:18:44,026 INFO L280 TraceCheckUtils]: 49: Hoare triple {1371#false} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,026 INFO L280 TraceCheckUtils]: 50: Hoare triple {1371#false} assume !(0 != ~mode4~0 % 256); {1371#false} is VALID [2020-07-29 03:18:44,026 INFO L280 TraceCheckUtils]: 51: Hoare triple {1371#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; {1371#false} is VALID [2020-07-29 03:18:44,026 INFO L280 TraceCheckUtils]: 52: Hoare triple {1371#false} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {1371#false} is VALID [2020-07-29 03:18:44,026 INFO L280 TraceCheckUtils]: 53: Hoare triple {1371#false} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,027 INFO L280 TraceCheckUtils]: 54: Hoare triple {1371#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1371#false} is VALID [2020-07-29 03:18:44,027 INFO L280 TraceCheckUtils]: 55: Hoare triple {1371#false} assume !(node5_~m5~0 != ~nomsg~0); {1371#false} is VALID [2020-07-29 03:18:44,027 INFO L280 TraceCheckUtils]: 56: Hoare triple {1371#false} ~mode5~0 := 0; {1371#false} is VALID [2020-07-29 03:18:44,028 INFO L280 TraceCheckUtils]: 57: Hoare triple {1371#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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1371#false} is VALID [2020-07-29 03:18:44,028 INFO L280 TraceCheckUtils]: 58: Hoare triple {1371#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1371#false} is VALID [2020-07-29 03:18:44,028 INFO L280 TraceCheckUtils]: 59: Hoare triple {1371#false} assume !(~r1~0 >= 5); {1371#false} is VALID [2020-07-29 03:18:44,028 INFO L280 TraceCheckUtils]: 60: Hoare triple {1371#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {1371#false} is VALID [2020-07-29 03:18:44,029 INFO L280 TraceCheckUtils]: 61: Hoare triple {1371#false} assume ~r1~0 < 5;check_~tmp~1 := 1; {1371#false} is VALID [2020-07-29 03:18:44,029 INFO L280 TraceCheckUtils]: 62: Hoare triple {1371#false} check_#res := check_~tmp~1; {1371#false} is VALID [2020-07-29 03:18:44,029 INFO L280 TraceCheckUtils]: 63: Hoare triple {1371#false} main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1371#false} is VALID [2020-07-29 03:18:44,030 INFO L280 TraceCheckUtils]: 64: Hoare triple {1371#false} assume !(0 == assert_~arg % 256); {1371#false} is VALID [2020-07-29 03:18:44,030 INFO L280 TraceCheckUtils]: 65: Hoare triple {1371#false} main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; {1371#false} is VALID [2020-07-29 03:18:44,038 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:44,039 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108031216] [2020-07-29 03:18:44,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:44,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:44,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211200201] [2020-07-29 03:18:44,581 WARN L193 SmtUtils]: Spent 531.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 148 [2020-07-29 03:18:45,151 WARN L193 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 137 [2020-07-29 03:18:45,169 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:45,169 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:45,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:45,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:45,170 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:18:45,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:45,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:45,170 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:45,170 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2020-07-29 03:18:45,170 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:45,171 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:45,264 INFO L141 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:45,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:45,279 INFO L141 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:45,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:45,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,313 INFO L141 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:45,317 INFO L141 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:45,532 WARN L193 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-07-29 03:18:45,535 INFO L141 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:45,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,542 INFO L141 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:45,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,554 INFO L141 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:45,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,561 INFO L141 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:45,564 INFO L141 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:45,573 INFO L141 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:45,577 INFO L141 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:45,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,596 INFO L141 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:45,600 INFO L141 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:45,604 INFO L141 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:45,607 INFO L141 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:45,614 INFO L141 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:45,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:45,627 INFO L141 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:45,631 INFO L141 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:45,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:46,438 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-07-29 03:18:46,670 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 03:18:54,070 WARN L193 SmtUtils]: Spent 7.21 s on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2020-07-29 03:18:54,374 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:54,374 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:54,382 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:18:54,382 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:54,414 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:18:54,415 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:18:54,618 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:18:54,619 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:54,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:54,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:54,620 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:54,620 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:18:54,620 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:54,620 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:54,620 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:54,620 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2020-07-29 03:18:54,620 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:54,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:54,674 INFO L141 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:54,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:54,686 INFO L141 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:54,690 INFO L141 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:54,714 INFO L141 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:54,719 INFO L141 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:54,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:54,731 INFO L141 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:54,738 INFO L141 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:54,742 INFO L141 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:54,746 INFO L141 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:54,750 INFO L141 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:54,755 INFO L141 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:54,968 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2020-07-29 03:18:54,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:54,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:54,982 INFO L141 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:54,991 INFO L141 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:54,994 INFO L141 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:55,004 INFO L141 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:55,009 INFO L141 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:55,017 INFO L141 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:55,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:55,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:55,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:55,039 INFO L141 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:55,048 INFO L141 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:55,053 INFO L141 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:55,059 INFO L141 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:55,856 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2020-07-29 03:18:56,042 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-07-29 03:19:03,697 WARN L193 SmtUtils]: Spent 7.43 s on a formula simplification. DAG size of input: 169 DAG size of output: 121 [2020-07-29 03:19:03,931 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:19:03,936 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:03,940 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:19:03,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:03,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:03,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:03,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:03,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:03,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:03,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:03,953 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:03,977 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:19:03,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:03,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:03,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:03,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:03,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:03,979 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:03,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:03,981 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,007 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:19:04,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,013 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:04,014 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:04,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,046 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:19:04,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,049 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:19:04,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,053 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:19:04,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:04,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,093 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:19:04,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:04,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:04,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,126 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:19:04,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:04,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,156 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:19:04,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,157 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,159 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:04,159 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:04,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:04,185 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,187 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:04,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,216 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:19:04,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:04,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,243 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:19:04,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,253 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:04,253 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:04,257 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,286 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:19:04,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,289 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:04,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,314 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:19:04,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:19:04,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:19:04,320 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,348 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:19:04,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,350 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2020-07-29 03:19:04,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,478 INFO L401 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2020-07-29 03:19:04,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:19:04,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:04,799 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:19:04,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:04,847 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:19:04,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,850 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,850 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:04,896 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:19:04,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:19:04,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:19:04,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:19:04,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:19:04,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:19:04,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:19:04,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:04,903 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:19:04,910 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:19:04,910 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:19:04,976 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:19:04,976 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:19:04,976 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:19:04,977 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:19:05,074 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:19:05,106 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 10);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 := ~p5_old~0;~p5_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);" "assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0;" "~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;" "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;" "havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume !(0 != ~mode4~0 % 256);" "assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0;" "~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1;" "havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1;" "assume !(~r1~0 >= 5);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0;" "assume ~r1~0 < 5;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;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~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28;" [2020-07-29 03:19:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:05,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:19:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:05,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:19:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:05,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:19:05,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {1373#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset]; {1373#unseeded} is VALID [2020-07-29 03:19:05,280 INFO L280 TraceCheckUtils]: 1: Hoare triple {1373#unseeded} havoc main_#res;havoc 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~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,280 INFO L280 TraceCheckUtils]: 2: Hoare triple {1373#unseeded} assume 0 == ~r1~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {1373#unseeded} assume ~id1~0 >= 0; {1373#unseeded} is VALID [2020-07-29 03:19:05,282 INFO L280 TraceCheckUtils]: 4: Hoare triple {1373#unseeded} assume 0 == ~st1~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,282 INFO L280 TraceCheckUtils]: 5: Hoare triple {1373#unseeded} assume ~send1~0 == ~id1~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,283 INFO L280 TraceCheckUtils]: 6: Hoare triple {1373#unseeded} assume 0 == ~mode1~0 % 256; {1373#unseeded} is VALID [2020-07-29 03:19:05,284 INFO L280 TraceCheckUtils]: 7: Hoare triple {1373#unseeded} assume ~id2~0 >= 0; {1373#unseeded} is VALID [2020-07-29 03:19:05,284 INFO L280 TraceCheckUtils]: 8: Hoare triple {1373#unseeded} assume 0 == ~st2~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {1373#unseeded} assume ~send2~0 == ~id2~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,286 INFO L280 TraceCheckUtils]: 10: Hoare triple {1373#unseeded} assume 0 == ~mode2~0 % 256; {1373#unseeded} is VALID [2020-07-29 03:19:05,287 INFO L280 TraceCheckUtils]: 11: Hoare triple {1373#unseeded} assume ~id3~0 >= 0; {1373#unseeded} is VALID [2020-07-29 03:19:05,287 INFO L280 TraceCheckUtils]: 12: Hoare triple {1373#unseeded} assume 0 == ~st3~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,288 INFO L280 TraceCheckUtils]: 13: Hoare triple {1373#unseeded} assume ~send3~0 == ~id3~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,289 INFO L280 TraceCheckUtils]: 14: Hoare triple {1373#unseeded} assume 0 == ~mode3~0 % 256; {1373#unseeded} is VALID [2020-07-29 03:19:05,289 INFO L280 TraceCheckUtils]: 15: Hoare triple {1373#unseeded} assume ~id4~0 >= 0; {1373#unseeded} is VALID [2020-07-29 03:19:05,290 INFO L280 TraceCheckUtils]: 16: Hoare triple {1373#unseeded} assume 0 == ~st4~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,291 INFO L280 TraceCheckUtils]: 17: Hoare triple {1373#unseeded} assume ~send4~0 == ~id4~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {1373#unseeded} assume 0 == ~mode4~0 % 256; {1373#unseeded} is VALID [2020-07-29 03:19:05,330 INFO L280 TraceCheckUtils]: 19: Hoare triple {1373#unseeded} assume ~id5~0 >= 0; {1373#unseeded} is VALID [2020-07-29 03:19:05,335 INFO L280 TraceCheckUtils]: 20: Hoare triple {1373#unseeded} assume 0 == ~st5~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {1373#unseeded} assume ~send5~0 == ~id5~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,338 INFO L280 TraceCheckUtils]: 22: Hoare triple {1373#unseeded} assume 0 == ~mode5~0 % 256; {1373#unseeded} is VALID [2020-07-29 03:19:05,338 INFO L280 TraceCheckUtils]: 23: Hoare triple {1373#unseeded} assume ~id1~0 != ~id2~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,339 INFO L280 TraceCheckUtils]: 24: Hoare triple {1373#unseeded} assume ~id1~0 != ~id3~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,339 INFO L280 TraceCheckUtils]: 25: Hoare triple {1373#unseeded} assume ~id1~0 != ~id4~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,340 INFO L280 TraceCheckUtils]: 26: Hoare triple {1373#unseeded} assume ~id1~0 != ~id5~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,340 INFO L280 TraceCheckUtils]: 27: Hoare triple {1373#unseeded} assume ~id2~0 != ~id3~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,341 INFO L280 TraceCheckUtils]: 28: Hoare triple {1373#unseeded} assume ~id2~0 != ~id4~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,341 INFO L280 TraceCheckUtils]: 29: Hoare triple {1373#unseeded} assume ~id2~0 != ~id5~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,342 INFO L280 TraceCheckUtils]: 30: Hoare triple {1373#unseeded} assume ~id3~0 != ~id4~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,343 INFO L280 TraceCheckUtils]: 31: Hoare triple {1373#unseeded} assume ~id3~0 != ~id5~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,343 INFO L280 TraceCheckUtils]: 32: Hoare triple {1373#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; {1373#unseeded} is VALID [2020-07-29 03:19:05,345 INFO L280 TraceCheckUtils]: 33: Hoare triple {1373#unseeded} init_#res := init_~tmp~0; {1373#unseeded} is VALID [2020-07-29 03:19:05,346 INFO L280 TraceCheckUtils]: 34: Hoare triple {1373#unseeded} main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1373#unseeded} is VALID [2020-07-29 03:19:05,346 INFO L280 TraceCheckUtils]: 35: Hoare triple {1373#unseeded} assume !(0 == assume_abort_if_not_~cond); {1373#unseeded} is VALID [2020-07-29 03:19:05,347 INFO L280 TraceCheckUtils]: 36: Hoare triple {1373#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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0 := 0; {1373#unseeded} is VALID [2020-07-29 03:19:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:05,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:19:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:19:05,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:19:05,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {1376#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19))} assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,471 INFO L280 TraceCheckUtils]: 2: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,472 INFO L280 TraceCheckUtils]: 3: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,473 INFO L280 TraceCheckUtils]: 4: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,474 INFO L280 TraceCheckUtils]: 5: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode2~0 % 256); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,475 INFO L280 TraceCheckUtils]: 6: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,475 INFO L280 TraceCheckUtils]: 7: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~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; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,480 INFO L280 TraceCheckUtils]: 9: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,483 INFO L280 TraceCheckUtils]: 10: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,484 INFO L280 TraceCheckUtils]: 12: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,485 INFO L280 TraceCheckUtils]: 13: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode4~0 % 256); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,486 INFO L280 TraceCheckUtils]: 14: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,487 INFO L280 TraceCheckUtils]: 15: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,495 INFO L280 TraceCheckUtils]: 16: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,496 INFO L280 TraceCheckUtils]: 17: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,496 INFO L280 TraceCheckUtils]: 18: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,497 INFO L280 TraceCheckUtils]: 19: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,498 INFO L280 TraceCheckUtils]: 20: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,498 INFO L280 TraceCheckUtils]: 21: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,499 INFO L280 TraceCheckUtils]: 22: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 5); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,499 INFO L280 TraceCheckUtils]: 23: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,500 INFO L280 TraceCheckUtils]: 24: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 5;check_~tmp~1 := 1; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,500 INFO L280 TraceCheckUtils]: 25: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,504 INFO L280 TraceCheckUtils]: 26: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,512 INFO L280 TraceCheckUtils]: 27: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:19:05,514 INFO L280 TraceCheckUtils]: 28: Hoare triple {1499#(and (< ULTIMATE.start_main_~i2~0 10) (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; {1386#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 19)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:19:05,514 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:19:05,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:19:05,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:19:05,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:05,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:05,565 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:19:05,566 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand 3 states. [2020-07-29 03:19:05,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 224 states and 323 transitions. Complement of second has 4 states. [2020-07-29 03:19:05,884 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:19:05,884 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:19:05,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. cyclomatic complexity: 50 [2020-07-29 03:19:05,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:05,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:05,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:19:05,896 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:19:05,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:19:05,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:19:05,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 323 transitions. [2020-07-29 03:19:05,904 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:05,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:19:05,909 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 131 states and 180 transitions. cyclomatic complexity: 50 [2020-07-29 03:19:05,990 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 94 examples of accepted words. [2020-07-29 03:19:05,991 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:19:05,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:19:05,993 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:19:05,994 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 224 states and 323 transitions. cyclomatic complexity: 100 [2020-07-29 03:19:05,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 323 transitions. cyclomatic complexity: 100 [2020-07-29 03:19:05,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:19:05,994 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:19:05,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:05,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:05,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:05,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:06,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:06,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:06,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:06,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 224 letters. Loop has 224 letters. [2020-07-29 03:19:06,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 224 letters. Loop has 224 letters. [2020-07-29 03:19:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 224 letters. Loop has 224 letters. [2020-07-29 03:19:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 131 letters. Loop has 131 letters. [2020-07-29 03:19:06,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 131 letters. Loop has 131 letters. [2020-07-29 03:19:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 131 letters. Loop has 131 letters. [2020-07-29 03:19:06,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:19:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:19:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:19:06,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:19:06,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:19:06,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 50 letters. Loop has 29 letters. [2020-07-29 03:19:06,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 29 letters. [2020-07-29 03:19:06,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 29 letters. [2020-07-29 03:19:06,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 44 letters. Loop has 29 letters. [2020-07-29 03:19:06,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 43 letters. Loop has 29 letters. [2020-07-29 03:19:06,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 29 letters. [2020-07-29 03:19:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 43 letters. Loop has 29 letters. [2020-07-29 03:19:06,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 30 letters. [2020-07-29 03:19:06,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 30 letters. [2020-07-29 03:19:06,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 44 letters. Loop has 30 letters. [2020-07-29 03:19:06,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:19:06,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:19:06,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 46 letters. Loop has 29 letters. [2020-07-29 03:19:06,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:19:06,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:19:06,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:19:06,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 85 letters. Loop has 30 letters. [2020-07-29 03:19:06,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 30 letters. [2020-07-29 03:19:06,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 85 letters. Loop has 30 letters. [2020-07-29 03:19:06,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 82 letters. Loop has 29 letters. [2020-07-29 03:19:06,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 29 letters. [2020-07-29 03:19:06,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 82 letters. Loop has 29 letters. [2020-07-29 03:19:06,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 48 letters. Loop has 30 letters. [2020-07-29 03:19:06,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 30 letters. [2020-07-29 03:19:06,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 48 letters. Loop has 30 letters. [2020-07-29 03:19:06,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 29 letters. [2020-07-29 03:19:06,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 29 letters. [2020-07-29 03:19:06,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 40 letters. Loop has 29 letters. [2020-07-29 03:19:06,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:19:06,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:19:06,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:19:06,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 39 letters. Loop has 29 letters. [2020-07-29 03:19:06,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 29 letters. [2020-07-29 03:19:06,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 39 letters. Loop has 29 letters. [2020-07-29 03:19:06,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:19:06,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:19:06,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:19:06,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:19:06,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:19:06,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 42 letters. Loop has 29 letters. [2020-07-29 03:19:06,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 85 letters. Loop has 29 letters. [2020-07-29 03:19:06,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 29 letters. [2020-07-29 03:19:06,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 85 letters. Loop has 29 letters. [2020-07-29 03:19:06,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 45 letters. Loop has 31 letters. [2020-07-29 03:19:06,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 31 letters. [2020-07-29 03:19:06,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 45 letters. Loop has 31 letters. [2020-07-29 03:19:06,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:19:06,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:19:06,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:19:06,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:19:06,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:19:06,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:19:06,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 88 letters. Loop has 29 letters. [2020-07-29 03:19:06,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 29 letters. [2020-07-29 03:19:06,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 88 letters. Loop has 29 letters. [2020-07-29 03:19:06,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:19:06,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:19:06,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:19:06,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:19:06,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:19:06,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 59 letters. Loop has 29 letters. [2020-07-29 03:19:06,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:19:06,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:19:06,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 58 letters. Loop has 29 letters. [2020-07-29 03:19:06,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:19:06,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:19:06,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 57 letters. Loop has 29 letters. [2020-07-29 03:19:06,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:19:06,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:19:06,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:19:06,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:19:06,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:19:06,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 56 letters. Loop has 29 letters. [2020-07-29 03:19:06,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:19:06,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:19:06,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:19:06,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:19:06,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:19:06,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:19:06,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:19:06,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:19:06,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 56 letters. Loop has 30 letters. [2020-07-29 03:19:06,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:19:06,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:19:06,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 55 letters. Loop has 29 letters. [2020-07-29 03:19:06,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:19:06,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:19:06,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 54 letters. Loop has 29 letters. [2020-07-29 03:19:06,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 29 letters. [2020-07-29 03:19:06,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 29 letters. [2020-07-29 03:19:06,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 81 letters. Loop has 29 letters. [2020-07-29 03:19:06,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 29 letters. [2020-07-29 03:19:06,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 29 letters. [2020-07-29 03:19:06,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 81 letters. Loop has 29 letters. [2020-07-29 03:19:06,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 80 letters. Loop has 29 letters. [2020-07-29 03:19:06,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 29 letters. [2020-07-29 03:19:06,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 80 letters. Loop has 29 letters. [2020-07-29 03:19:06,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 82 letters. Loop has 31 letters. [2020-07-29 03:19:06,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 31 letters. [2020-07-29 03:19:06,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 82 letters. Loop has 31 letters. [2020-07-29 03:19:06,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 80 letters. Loop has 29 letters. [2020-07-29 03:19:06,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 29 letters. [2020-07-29 03:19:06,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 80 letters. Loop has 29 letters. [2020-07-29 03:19:06,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 30 letters. [2020-07-29 03:19:06,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 30 letters. [2020-07-29 03:19:06,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 81 letters. Loop has 30 letters. [2020-07-29 03:19:06,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 79 letters. Loop has 29 letters. [2020-07-29 03:19:06,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 29 letters. [2020-07-29 03:19:06,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 79 letters. Loop has 29 letters. [2020-07-29 03:19:06,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 78 letters. Loop has 29 letters. [2020-07-29 03:19:06,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 29 letters. [2020-07-29 03:19:06,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 78 letters. Loop has 29 letters. [2020-07-29 03:19:06,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:19:06,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:19:06,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:19:06,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:19:06,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:19:06,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 77 letters. Loop has 29 letters. [2020-07-29 03:19:06,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:19:06,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:19:06,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:19:06,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 78 letters. Loop has 31 letters. [2020-07-29 03:19:06,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 31 letters. [2020-07-29 03:19:06,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 78 letters. Loop has 31 letters. [2020-07-29 03:19:06,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:19:06,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:19:06,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 76 letters. Loop has 29 letters. [2020-07-29 03:19:06,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 30 letters. [2020-07-29 03:19:06,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 30 letters. [2020-07-29 03:19:06,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 77 letters. Loop has 30 letters. [2020-07-29 03:19:06,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:19:06,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:19:06,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 75 letters. Loop has 29 letters. [2020-07-29 03:19:06,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:19:06,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:19:06,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 74 letters. Loop has 29 letters. [2020-07-29 03:19:06,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:19:06,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:19:06,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:19:06,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:19:06,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:19:06,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 73 letters. Loop has 29 letters. [2020-07-29 03:19:06,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:19:06,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:19:06,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:19:06,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:19:06,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:19:06,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:19:06,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:19:06,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:19:06,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 72 letters. Loop has 29 letters. [2020-07-29 03:19:06,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 73 letters. Loop has 30 letters. [2020-07-29 03:19:06,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 30 letters. [2020-07-29 03:19:06,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 73 letters. Loop has 30 letters. [2020-07-29 03:19:06,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:19:06,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:19:06,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 71 letters. Loop has 29 letters. [2020-07-29 03:19:06,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:19:06,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:19:06,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 70 letters. Loop has 29 letters. [2020-07-29 03:19:06,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:19:06,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:19:06,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 69 letters. Loop has 29 letters. [2020-07-29 03:19:06,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:19:06,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:19:06,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 68 letters. Loop has 29 letters. [2020-07-29 03:19:06,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:19:06,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:19:06,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 67 letters. Loop has 29 letters. [2020-07-29 03:19:06,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:19:06,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:19:06,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:19:06,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:19:06,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:19:06,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 51 letters. Loop has 29 letters. [2020-07-29 03:19:06,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:19:06,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:19:06,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:19:06,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:19:06,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:19:06,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 52 letters. Loop has 29 letters. [2020-07-29 03:19:06,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:19:06,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:19:06,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:19:06,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:19:06,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:19:06,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 52 letters. Loop has 30 letters. [2020-07-29 03:19:06,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:19:06,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:19:06,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:19:06,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:19:06,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:19:06,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 63 letters. Loop has 29 letters. [2020-07-29 03:19:06,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:19:06,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:19:06,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 64 letters. Loop has 29 letters. [2020-07-29 03:19:06,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:19:06,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:19:06,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 61 letters. Loop has 29 letters. [2020-07-29 03:19:06,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:19:06,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:19:06,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 62 letters. Loop has 29 letters. [2020-07-29 03:19:06,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:06,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:06,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:06,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 38 letters. Loop has 29 letters. [2020-07-29 03:19:06,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 29 letters. [2020-07-29 03:19:06,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 38 letters. Loop has 29 letters. [2020-07-29 03:19:06,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 29 letters. [2020-07-29 03:19:06,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 29 letters. [2020-07-29 03:19:06,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 44 letters. Loop has 29 letters. [2020-07-29 03:19:06,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:19:06,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:19:06,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 45 letters. Loop has 29 letters. [2020-07-29 03:19:06,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 83 letters. Loop has 29 letters. [2020-07-29 03:19:06,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 29 letters. [2020-07-29 03:19:06,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 83 letters. Loop has 29 letters. [2020-07-29 03:19:06,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 84 letters. Loop has 29 letters. [2020-07-29 03:19:06,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 29 letters. [2020-07-29 03:19:06,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 84 letters. Loop has 29 letters. [2020-07-29 03:19:06,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 84 letters. Loop has 29 letters. [2020-07-29 03:19:06,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 29 letters. [2020-07-29 03:19:06,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 84 letters. Loop has 29 letters. [2020-07-29 03:19:06,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 41 letters. Loop has 31 letters. [2020-07-29 03:19:06,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 31 letters. [2020-07-29 03:19:06,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 41 letters. Loop has 31 letters. [2020-07-29 03:19:06,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 29 letters. [2020-07-29 03:19:06,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 29 letters. [2020-07-29 03:19:06,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 40 letters. Loop has 29 letters. [2020-07-29 03:19:06,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 43 letters. Loop has 29 letters. [2020-07-29 03:19:06,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 29 letters. [2020-07-29 03:19:06,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 43 letters. Loop has 29 letters. [2020-07-29 03:19:06,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:19:06,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:19:06,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:19:06,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:19:06,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:19:06,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 60 letters. Loop has 29 letters. [2020-07-29 03:19:06,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:19:06,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:19:06,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 47 letters. Loop has 29 letters. [2020-07-29 03:19:06,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:19:06,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:19:06,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:19:06,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:19:06,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:19:06,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 41 letters. Loop has 29 letters. [2020-07-29 03:19:06,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 86 letters. Loop has 31 letters. [2020-07-29 03:19:06,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 31 letters. [2020-07-29 03:19:06,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 86 letters. Loop has 31 letters. [2020-07-29 03:19:06,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 85 letters. Loop has 29 letters. [2020-07-29 03:19:06,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 29 letters. [2020-07-29 03:19:06,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 85 letters. Loop has 29 letters. [2020-07-29 03:19:06,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 39 letters. Loop has 29 letters. [2020-07-29 03:19:06,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 29 letters. [2020-07-29 03:19:06,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 39 letters. Loop has 29 letters. [2020-07-29 03:19:06,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 30 letters. [2020-07-29 03:19:06,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 30 letters. [2020-07-29 03:19:06,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 40 letters. Loop has 30 letters. [2020-07-29 03:19:06,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 86 letters. Loop has 29 letters. [2020-07-29 03:19:06,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 29 letters. [2020-07-29 03:19:06,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 86 letters. Loop has 29 letters. [2020-07-29 03:19:06,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 87 letters. Loop has 29 letters. [2020-07-29 03:19:06,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 29 letters. [2020-07-29 03:19:06,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 87 letters. Loop has 29 letters. [2020-07-29 03:19:06,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:19:06,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:19:06,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 53 letters. Loop has 29 letters. [2020-07-29 03:19:06,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:19:06,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:19:06,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:19:06,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:19:06,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:19:06,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 48 letters. Loop has 29 letters. [2020-07-29 03:19:06,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:19:06,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:19:06,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 65 letters. Loop has 29 letters. [2020-07-29 03:19:06,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:19:06,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:19:06,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 49 letters. Loop has 29 letters. [2020-07-29 03:19:06,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:06,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:06,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:19:06,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,207 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:19:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:19:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2020-07-29 03:19:06,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 29 letters. [2020-07-29 03:19:06,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 66 letters. Loop has 29 letters. [2020-07-29 03:19:06,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 58 letters. [2020-07-29 03:19:06,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:19:06,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 323 transitions. cyclomatic complexity: 100 [2020-07-29 03:19:06,224 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:06,224 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2020-07-29 03:19:06,224 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:19:06,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:19:06,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:19:06,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:06,225 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:06,225 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:06,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:19:06,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:19:06,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:19:06,226 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:19:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:19:06,227 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:19:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:19:06,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:19:06,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:19:06,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:19:06,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:06,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:19:06,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:19:06,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:19:06,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:19:06,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:19:06,320 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:06,321 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:06,321 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:19:06,321 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:19:06,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:19:06,321 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:19:06,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:19:06,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:19:06 BoogieIcfgContainer [2020-07-29 03:19:06,328 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:19:06,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:19:06,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:19:06,328 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:19:06,329 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:41" (3/4) ... [2020-07-29 03:19:06,333 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:19:06,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:19:06,335 INFO L168 Benchmark]: Toolchain (without parser) took 26780.33 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 542.1 MB). Free memory was 956.2 MB in the beginning and 1.4 GB in the end (delta: -403.0 MB). Peak memory consumption was 139.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:06,336 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:19:06,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 487.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:06,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.45 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:06,338 INFO L168 Benchmark]: Boogie Preprocessor took 43.87 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:19:06,338 INFO L168 Benchmark]: RCFGBuilder took 941.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:06,339 INFO L168 Benchmark]: BuchiAutomizer took 25223.59 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 407.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -314.1 MB). Peak memory consumption was 93.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:19:06,339 INFO L168 Benchmark]: Witness Printer took 4.98 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:19:06,343 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 487.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.45 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.87 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. * RCFGBuilder took 941.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 72.2 MB). Peak memory consumption was 72.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 25223.59 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 407.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -314.1 MB). Peak memory consumption was 93.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.98 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 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 + 19 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 25.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 22.3s. Construction of modules took 0.0s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 550 SDtfs, 231 SDslu, 937 SDs, 0 SdLazy, 36 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax127 hnf105 lsp54 ukn69 mio100 lsp100 div155 bol100 ite100 ukn100 eq175 hnf71 smp100 dnf5255 smp24 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 385ms VariablesStem: 0 VariablesLoop: 30 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...