./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.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-var-start-time.6.ufo.BOUNDED-12.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 cb944a18d66a87f15463ca34f8c0761d9180a7c3 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:17:57,565 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:17:57,568 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:17:57,584 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:17:57,584 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:17:57,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:17:57,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:17:57,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:17:57,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:17:57,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:17:57,595 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:17:57,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:17:57,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:17:57,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:17:57,599 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:17:57,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:17:57,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:17:57,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:17:57,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:17:57,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:17:57,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:17:57,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:17:57,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:17:57,614 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:17:57,617 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:17:57,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:17:57,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:17:57,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:17:57,620 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:17:57,621 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:17:57,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:17:57,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:17:57,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:17:57,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:17:57,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:17:57,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:17:57,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:17:57,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:17:57,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:17:57,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:17:57,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:17:57,632 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:17:57,651 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:17:57,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:17:57,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:17:57,654 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:17:57,654 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:17:57,655 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:17:57,655 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:17:57,655 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:17:57,655 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:17:57,656 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:17:57,656 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:17:57,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:17:57,657 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:17:57,657 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:17:57,657 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:17:57,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:17:57,658 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:17:57,658 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:17:57,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:17:57,659 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:17:57,659 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:17:57,659 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:17:57,659 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:17:57,660 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:17:57,660 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:17:57,660 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:17:57,660 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:17:57,661 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:17:57,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:17:57,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:17:57,662 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:17:57,662 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:17:57,663 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:17:57,663 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 -> cb944a18d66a87f15463ca34f8c0761d9180a7c3 [2020-07-29 03:17:57,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:17:57,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:17:58,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:17:58,003 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:17:58,003 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:17:58,004 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:58,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5429e02/01fcba2d77bf4adea4e330edc033404d/FLAGd70608e7e [2020-07-29 03:17:58,657 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:17:58,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:58,680 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5429e02/01fcba2d77bf4adea4e330edc033404d/FLAGd70608e7e [2020-07-29 03:17:58,924 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee5429e02/01fcba2d77bf4adea4e330edc033404d [2020-07-29 03:17:58,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:17:58,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:17:58,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:58,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:17:58,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:17:58,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:58" (1/1) ... [2020-07-29 03:17:58,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f5f43c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:58, skipping insertion in model container [2020-07-29 03:17:58,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:58" (1/1) ... [2020-07-29 03:17:58,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:17:59,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:17:59,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:59,350 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:17:59,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:59,573 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:17:59,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59 WrapperNode [2020-07-29 03:17:59,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:59,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:59,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:17:59,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:17:59,583 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:17:59" (1/1) ... [2020-07-29 03:17:59,596 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:17:59" (1/1) ... [2020-07-29 03:17:59,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:59,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:17:59,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:17:59,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:17:59,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,685 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,746 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (1/1) ... [2020-07-29 03:17:59,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:17:59,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:17:59,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:17:59,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:17:59,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (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:17:59,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:17:59,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:18:00,878 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:18:00,878 INFO L295 CfgBuilder]: Removed 25 assume(true) statements. [2020-07-29 03:18:00,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:00 BoogieIcfgContainer [2020-07-29 03:18:00,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:18:00,891 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:18:00,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:18:00,895 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:18:00,896 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:00,897 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:17:58" (1/3) ... [2020-07-29 03:18:00,899 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25af0881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:00, skipping insertion in model container [2020-07-29 03:18:00,899 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:00,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:59" (2/3) ... [2020-07-29 03:18:00,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25af0881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:18:00, skipping insertion in model container [2020-07-29 03:18:00,901 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:18:00,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:18:00" (3/3) ... [2020-07-29 03:18:00,903 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c [2020-07-29 03:18:00,955 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:18:00,955 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:18:00,955 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:18:00,955 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:18:00,956 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:18:00,956 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:18:00,956 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:18:00,956 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:18:00,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states. [2020-07-29 03:18:01,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2020-07-29 03:18:01,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:01,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:01,044 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:01,044 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, 1] [2020-07-29 03:18:01,045 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:18:01,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states. [2020-07-29 03:18:01,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2020-07-29 03:18:01,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:01,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:01,065 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:01,065 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, 1] [2020-07-29 03:18:01,074 INFO L794 eck$LassoCheckResult]: Stem: 104#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 13#L-1true havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 146#L335true assume !(0 == ~r1~0);init_~tmp~0 := 0; 131#L335-1true init_#res := init_~tmp~0; 136#L500true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 52#L67true assume 0 == assume_abort_if_not_~cond;assume false; 108#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 48#L576-2true [2020-07-29 03:18:01,077 INFO L796 eck$LassoCheckResult]: Loop: 48#L576-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 125#L129true 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 42#L133true assume !(node1_~m1~0 != ~nomsg~0); 53#L133-1true ~mode1~0 := 0; 118#L129-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 22#L164true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 134#L167true assume !(node2_~m2~0 != ~nomsg~0); 133#L167-1true ~mode2~0 := 0; 19#L164-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 97#L198true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 79#L201true assume !(node3_~m3~0 != ~nomsg~0); 78#L201-1true ~mode3~0 := 0; 109#L198-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 45#L232true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 50#L235true assume !(node4_~m4~0 != ~nomsg~0); 47#L235-1true ~mode4~0 := 0; 43#L232-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 15#L266true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 141#L269true assume !(node5_~m5~0 != ~nomsg~0); 140#L269-1true ~mode5~0 := 0; 135#L266-2true havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 107#L300true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 75#L303true assume !(node6_~m6~0 != ~nomsg~0); 91#L303-1true ~mode6~0 := 0; 103#L300-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 18#L508true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 20#L508-1true check_#res := check_~tmp~1; 105#L520true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 62#L609true assume !(0 == assert_~arg % 256); 35#L604true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 48#L576-2true [2020-07-29 03:18:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:01,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2020-07-29 03:18:01,105 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:01,105 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647688928] [2020-07-29 03:18:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:01,322 INFO L280 TraceCheckUtils]: 0: Hoare triple {148#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {148#true} is VALID [2020-07-29 03:18:01,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#true} havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {148#true} is VALID [2020-07-29 03:18:01,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {148#true} is VALID [2020-07-29 03:18:01,323 INFO L280 TraceCheckUtils]: 3: Hoare triple {148#true} init_#res := init_~tmp~0; {148#true} is VALID [2020-07-29 03:18:01,323 INFO L280 TraceCheckUtils]: 4: Hoare triple {148#true} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; {148#true} is VALID [2020-07-29 03:18:01,325 INFO L280 TraceCheckUtils]: 5: Hoare triple {148#true} assume 0 == assume_abort_if_not_~cond;assume false; {149#false} is VALID [2020-07-29 03:18:01,325 INFO L280 TraceCheckUtils]: 6: Hoare triple {149#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {149#false} is VALID [2020-07-29 03:18:01,328 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:01,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647688928] [2020-07-29 03:18:01,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:01,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:18:01,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562221536] [2020-07-29 03:18:01,339 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:18:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 1 times [2020-07-29 03:18:01,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:01,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719255385] [2020-07-29 03:18:01,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:01,610 INFO L280 TraceCheckUtils]: 0: Hoare triple {150#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,611 INFO L280 TraceCheckUtils]: 1: Hoare triple {150#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(node1_~m1~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:18:01,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {150#true} ~mode1~0 := 0; {150#true} is VALID [2020-07-29 03:18:01,612 INFO L280 TraceCheckUtils]: 4: Hoare triple {150#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(node2_~m2~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:18:01,613 INFO L280 TraceCheckUtils]: 7: Hoare triple {150#true} ~mode2~0 := 0; {150#true} is VALID [2020-07-29 03:18:01,614 INFO L280 TraceCheckUtils]: 8: Hoare triple {150#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,614 INFO L280 TraceCheckUtils]: 9: Hoare triple {150#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,615 INFO L280 TraceCheckUtils]: 10: Hoare triple {150#true} assume !(node3_~m3~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:18:01,615 INFO L280 TraceCheckUtils]: 11: Hoare triple {150#true} ~mode3~0 := 0; {150#true} is VALID [2020-07-29 03:18:01,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {150#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,616 INFO L280 TraceCheckUtils]: 13: Hoare triple {150#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,616 INFO L280 TraceCheckUtils]: 14: Hoare triple {150#true} assume !(node4_~m4~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:18:01,616 INFO L280 TraceCheckUtils]: 15: Hoare triple {150#true} ~mode4~0 := 0; {150#true} is VALID [2020-07-29 03:18:01,617 INFO L280 TraceCheckUtils]: 16: Hoare triple {150#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,617 INFO L280 TraceCheckUtils]: 17: Hoare triple {150#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,618 INFO L280 TraceCheckUtils]: 18: Hoare triple {150#true} assume !(node5_~m5~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:18:01,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {150#true} ~mode5~0 := 0; {150#true} is VALID [2020-07-29 03:18:01,619 INFO L280 TraceCheckUtils]: 20: Hoare triple {150#true} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,619 INFO L280 TraceCheckUtils]: 21: Hoare triple {150#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:18:01,620 INFO L280 TraceCheckUtils]: 22: Hoare triple {150#true} assume !(node6_~m6~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:18:01,620 INFO L280 TraceCheckUtils]: 23: Hoare triple {150#true} ~mode6~0 := 0; {150#true} is VALID [2020-07-29 03:18:01,621 INFO L280 TraceCheckUtils]: 24: Hoare triple {150#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {150#true} is VALID [2020-07-29 03:18:01,622 INFO L280 TraceCheckUtils]: 25: Hoare triple {150#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {152#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:01,624 INFO L280 TraceCheckUtils]: 26: Hoare triple {152#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {153#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:01,627 INFO L280 TraceCheckUtils]: 27: Hoare triple {153#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {154#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:01,628 INFO L280 TraceCheckUtils]: 28: Hoare triple {154#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {151#false} is VALID [2020-07-29 03:18:01,629 INFO L280 TraceCheckUtils]: 29: Hoare triple {151#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {151#false} is VALID [2020-07-29 03:18:01,633 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:01,634 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719255385] [2020-07-29 03:18:01,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:01,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:01,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068309560] [2020-07-29 03:18:01,638 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:01,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:01,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 03:18:01,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 03:18:01,660 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 2 states. [2020-07-29 03:18:01,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:01,867 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2020-07-29 03:18:01,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:18:01,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:18:01,891 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:01,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 242 transitions. [2020-07-29 03:18:01,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:18:01,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 139 states and 237 transitions. [2020-07-29 03:18:01,919 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-07-29 03:18:01,920 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-07-29 03:18:01,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 237 transitions. [2020-07-29 03:18:01,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:01,923 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2020-07-29 03:18:01,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 237 transitions. [2020-07-29 03:18:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-07-29 03:18:01,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:01,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 237 transitions. Second operand 139 states. [2020-07-29 03:18:01,970 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 237 transitions. Second operand 139 states. [2020-07-29 03:18:01,971 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. Second operand 139 states. [2020-07-29 03:18:01,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:01,982 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2020-07-29 03:18:01,983 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2020-07-29 03:18:01,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:01,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:01,986 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states and 237 transitions. [2020-07-29 03:18:01,986 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states and 237 transitions. [2020-07-29 03:18:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:01,996 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2020-07-29 03:18:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2020-07-29 03:18:01,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:01,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:01,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:01,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-07-29 03:18:02,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 237 transitions. [2020-07-29 03:18:02,009 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2020-07-29 03:18:02,010 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2020-07-29 03:18:02,010 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:18:02,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 237 transitions. [2020-07-29 03:18:02,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:18:02,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:02,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:02,015 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:02,015 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, 1] [2020-07-29 03:18:02,016 INFO L794 eck$LassoCheckResult]: Stem: 430#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 319#L-1 havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 320#L335 assume !(0 == ~r1~0);init_~tmp~0 := 0; 304#L335-1 init_#res := init_~tmp~0; 437#L500 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 387#L67 assume !(0 == assume_abort_if_not_~cond); 388#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 358#L576-2 [2020-07-29 03:18:02,016 INFO L796 eck$LassoCheckResult]: Loop: 358#L576-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 385#L129 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 373#L133 assume !(node1_~m1~0 != ~nomsg~0); 375#L133-1 ~mode1~0 := 0; 318#L129-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 335#L164 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 337#L167 assume !(node2_~m2~0 != ~nomsg~0); 347#L167-1 ~mode2~0 := 0; 331#L164-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 332#L198 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 416#L201 assume !(node3_~m3~0 != ~nomsg~0); 381#L201-1 ~mode3~0 := 0; 410#L198-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 378#L232 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 379#L235 assume !(node4_~m4~0 != ~nomsg~0); 383#L235-1 ~mode4~0 := 0; 300#L232-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 323#L266 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 325#L269 assume !(node5_~m5~0 != ~nomsg~0); 313#L269-1 ~mode5~0 := 0; 426#L266-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 431#L300 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 412#L303 assume !(node6_~m6~0 != ~nomsg~0); 365#L303-1 ~mode6~0 := 0; 384#L300-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 328#L508 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 329#L508-1 check_#res := check_~tmp~1; 333#L520 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 397#L609 assume !(0 == assert_~arg % 256); 357#L604 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 358#L576-2 [2020-07-29 03:18:02,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:02,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2020-07-29 03:18:02,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:02,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902215186] [2020-07-29 03:18:02,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:02,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:02,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {719#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {719#true} is VALID [2020-07-29 03:18:02,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#true} havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {719#true} is VALID [2020-07-29 03:18:02,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {721#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:18:02,113 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {722#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:18:02,115 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; {723#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:18:02,116 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {720#false} is VALID [2020-07-29 03:18:02,116 INFO L280 TraceCheckUtils]: 6: Hoare triple {720#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {720#false} is VALID [2020-07-29 03:18:02,117 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:02,117 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902215186] [2020-07-29 03:18:02,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:02,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:02,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424287884] [2020-07-29 03:18:02,118 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:18:02,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:02,119 INFO L82 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 2 times [2020-07-29 03:18:02,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:02,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195168678] [2020-07-29 03:18:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:02,293 INFO L280 TraceCheckUtils]: 0: Hoare triple {724#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,295 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume !(node1_~m1~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:18:02,295 INFO L280 TraceCheckUtils]: 3: Hoare triple {724#true} ~mode1~0 := 0; {724#true} is VALID [2020-07-29 03:18:02,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {724#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,296 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,296 INFO L280 TraceCheckUtils]: 6: Hoare triple {724#true} assume !(node2_~m2~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:18:02,297 INFO L280 TraceCheckUtils]: 7: Hoare triple {724#true} ~mode2~0 := 0; {724#true} is VALID [2020-07-29 03:18:02,297 INFO L280 TraceCheckUtils]: 8: Hoare triple {724#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,298 INFO L280 TraceCheckUtils]: 9: Hoare triple {724#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,298 INFO L280 TraceCheckUtils]: 10: Hoare triple {724#true} assume !(node3_~m3~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:18:02,298 INFO L280 TraceCheckUtils]: 11: Hoare triple {724#true} ~mode3~0 := 0; {724#true} is VALID [2020-07-29 03:18:02,299 INFO L280 TraceCheckUtils]: 12: Hoare triple {724#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,299 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,299 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#true} assume !(node4_~m4~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:18:02,300 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#true} ~mode4~0 := 0; {724#true} is VALID [2020-07-29 03:18:02,300 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,301 INFO L280 TraceCheckUtils]: 17: Hoare triple {724#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,301 INFO L280 TraceCheckUtils]: 18: Hoare triple {724#true} assume !(node5_~m5~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:18:02,302 INFO L280 TraceCheckUtils]: 19: Hoare triple {724#true} ~mode5~0 := 0; {724#true} is VALID [2020-07-29 03:18:02,302 INFO L280 TraceCheckUtils]: 20: Hoare triple {724#true} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,303 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:18:02,303 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#true} assume !(node6_~m6~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:18:02,304 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#true} ~mode6~0 := 0; {724#true} is VALID [2020-07-29 03:18:02,304 INFO L280 TraceCheckUtils]: 24: Hoare triple {724#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {724#true} is VALID [2020-07-29 03:18:02,305 INFO L280 TraceCheckUtils]: 25: Hoare triple {724#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {726#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:02,307 INFO L280 TraceCheckUtils]: 26: Hoare triple {726#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {727#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:02,308 INFO L280 TraceCheckUtils]: 27: Hoare triple {727#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {728#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:02,310 INFO L280 TraceCheckUtils]: 28: Hoare triple {728#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {725#false} is VALID [2020-07-29 03:18:02,310 INFO L280 TraceCheckUtils]: 29: Hoare triple {725#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {725#false} is VALID [2020-07-29 03:18:02,312 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:02,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195168678] [2020-07-29 03:18:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550583214] [2020-07-29 03:18:02,314 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:02,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:02,315 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. cyclomatic complexity: 99 Second operand 5 states. [2020-07-29 03:18:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:03,053 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2020-07-29 03:18:03,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:03,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:03,068 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:03,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 239 transitions. [2020-07-29 03:18:03,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:18:03,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 196 transitions. [2020-07-29 03:18:03,093 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-07-29 03:18:03,094 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-07-29 03:18:03,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 196 transitions. [2020-07-29 03:18:03,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:03,098 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2020-07-29 03:18:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 196 transitions. [2020-07-29 03:18:03,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-07-29 03:18:03,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:03,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 196 transitions. Second operand 139 states. [2020-07-29 03:18:03,118 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 196 transitions. Second operand 139 states. [2020-07-29 03:18:03,118 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand 139 states. [2020-07-29 03:18:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:03,125 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2020-07-29 03:18:03,126 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2020-07-29 03:18:03,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:03,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:03,131 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states and 196 transitions. [2020-07-29 03:18:03,132 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states and 196 transitions. [2020-07-29 03:18:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:03,138 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2020-07-29 03:18:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2020-07-29 03:18:03,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:03,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:03,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:03,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-07-29 03:18:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2020-07-29 03:18:03,151 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2020-07-29 03:18:03,151 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2020-07-29 03:18:03,151 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:18:03,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 196 transitions. [2020-07-29 03:18:03,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:18:03,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:03,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:03,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:03,157 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, 1] [2020-07-29 03:18:03,167 INFO L794 eck$LassoCheckResult]: Stem: 1006#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 894#L-1 havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 895#L335 assume 0 == ~r1~0; 999#L336 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 936#L337 assume ~id1~0 >= 0; 937#L338 assume 0 == ~st1~0; 983#L339 assume ~send1~0 == ~id1~0; 896#L340 assume 0 == ~mode1~0 % 256; 897#L341 assume ~id2~0 >= 0; 975#L342 assume 0 == ~st2~0; 885#L343 assume ~send2~0 == ~id2~0; 886#L344 assume 0 == ~mode2~0 % 256; 946#L345 assume ~id3~0 >= 0; 947#L346 assume 0 == ~st3~0; 998#L347 assume ~send3~0 == ~id3~0; 934#L348 assume 0 == ~mode3~0 % 256; 935#L349 assume ~id4~0 >= 0; 982#L350 assume 0 == ~st4~0; 924#L351 assume ~send4~0 == ~id4~0; 925#L352 assume 0 == ~mode4~0 % 256; 974#L353 assume ~id5~0 >= 0; 881#L354 assume 0 == ~st5~0; 882#L355 assume ~send5~0 == ~id5~0; 944#L356 assume 0 == ~mode5~0 % 256; 945#L357 assume ~id6~0 >= 0; 997#L358 assume 0 == ~st6~0; 930#L359 assume ~send6~0 == ~id6~0; 931#L360 assume 0 == ~mode6~0 % 256; 981#L361 assume ~id1~0 != ~id2~0; 922#L362 assume ~id1~0 != ~id3~0; 923#L363 assume ~id1~0 != ~id4~0; 972#L364 assume ~id1~0 != ~id5~0; 879#L365 assume ~id1~0 != ~id6~0; 880#L366 assume ~id2~0 != ~id3~0; 964#L367 assume ~id2~0 != ~id4~0; 965#L368 assume ~id2~0 != ~id5~0; 995#L369 assume ~id2~0 != ~id6~0; 928#L370 assume ~id3~0 != ~id4~0; 929#L371 assume ~id3~0 != ~id5~0; 979#L372 assume ~id3~0 != ~id6~0; 917#L373 assume ~id4~0 != ~id5~0; 918#L374 assume ~id4~0 != ~id6~0; 969#L375 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 970#L335-1 init_#res := init_~tmp~0; 1013#L500 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 962#L67 assume !(0 == assume_abort_if_not_~cond); 963#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 933#L576-2 [2020-07-29 03:18:03,168 INFO L796 eck$LassoCheckResult]: Loop: 933#L576-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 959#L129 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 948#L133 assume !(node1_~m1~0 != ~nomsg~0); 950#L133-1 ~mode1~0 := 0; 892#L129-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 910#L164 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 912#L167 assume !(node2_~m2~0 != ~nomsg~0); 920#L167-1 ~mode2~0 := 0; 906#L164-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 907#L198 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 992#L201 assume !(node3_~m3~0 != ~nomsg~0); 956#L201-1 ~mode3~0 := 0; 986#L198-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 953#L232 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 954#L235 assume !(node4_~m4~0 != ~nomsg~0); 958#L235-1 ~mode4~0 := 0; 876#L232-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 898#L266 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 900#L269 assume !(node5_~m5~0 != ~nomsg~0); 888#L269-1 ~mode5~0 := 0; 1002#L266-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1007#L300 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 988#L303 assume !(node6_~m6~0 != ~nomsg~0); 940#L303-1 ~mode6~0 := 0; 960#L300-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 903#L508 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 904#L508-1 check_#res := check_~tmp~1; 908#L520 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 973#L609 assume !(0 == assert_~arg % 256); 932#L604 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 933#L576-2 [2020-07-29 03:18:03,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:03,169 INFO L82 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2020-07-29 03:18:03,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:03,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566474316] [2020-07-29 03:18:03,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:03,272 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:03,329 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:03,385 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 3 times [2020-07-29 03:18:03,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:03,387 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680898807] [2020-07-29 03:18:03,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:03,480 INFO L280 TraceCheckUtils]: 0: Hoare triple {1297#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,480 INFO L280 TraceCheckUtils]: 1: Hoare triple {1297#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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,480 INFO L280 TraceCheckUtils]: 2: Hoare triple {1297#true} assume !(node1_~m1~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:18:03,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {1297#true} ~mode1~0 := 0; {1297#true} is VALID [2020-07-29 03:18:03,481 INFO L280 TraceCheckUtils]: 4: Hoare triple {1297#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,481 INFO L280 TraceCheckUtils]: 5: Hoare triple {1297#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {1297#true} assume !(node2_~m2~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:18:03,482 INFO L280 TraceCheckUtils]: 7: Hoare triple {1297#true} ~mode2~0 := 0; {1297#true} is VALID [2020-07-29 03:18:03,482 INFO L280 TraceCheckUtils]: 8: Hoare triple {1297#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,482 INFO L280 TraceCheckUtils]: 9: Hoare triple {1297#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,482 INFO L280 TraceCheckUtils]: 10: Hoare triple {1297#true} assume !(node3_~m3~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:18:03,483 INFO L280 TraceCheckUtils]: 11: Hoare triple {1297#true} ~mode3~0 := 0; {1297#true} is VALID [2020-07-29 03:18:03,483 INFO L280 TraceCheckUtils]: 12: Hoare triple {1297#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,483 INFO L280 TraceCheckUtils]: 13: Hoare triple {1297#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,483 INFO L280 TraceCheckUtils]: 14: Hoare triple {1297#true} assume !(node4_~m4~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:18:03,483 INFO L280 TraceCheckUtils]: 15: Hoare triple {1297#true} ~mode4~0 := 0; {1297#true} is VALID [2020-07-29 03:18:03,484 INFO L280 TraceCheckUtils]: 16: Hoare triple {1297#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,484 INFO L280 TraceCheckUtils]: 17: Hoare triple {1297#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,485 INFO L280 TraceCheckUtils]: 18: Hoare triple {1297#true} assume !(node5_~m5~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:18:03,485 INFO L280 TraceCheckUtils]: 19: Hoare triple {1297#true} ~mode5~0 := 0; {1297#true} is VALID [2020-07-29 03:18:03,485 INFO L280 TraceCheckUtils]: 20: Hoare triple {1297#true} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,485 INFO L280 TraceCheckUtils]: 21: Hoare triple {1297#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:18:03,486 INFO L280 TraceCheckUtils]: 22: Hoare triple {1297#true} assume !(node6_~m6~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:18:03,486 INFO L280 TraceCheckUtils]: 23: Hoare triple {1297#true} ~mode6~0 := 0; {1297#true} is VALID [2020-07-29 03:18:03,486 INFO L280 TraceCheckUtils]: 24: Hoare triple {1297#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1297#true} is VALID [2020-07-29 03:18:03,487 INFO L280 TraceCheckUtils]: 25: Hoare triple {1297#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {1299#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:18:03,488 INFO L280 TraceCheckUtils]: 26: Hoare triple {1299#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {1300#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:18:03,489 INFO L280 TraceCheckUtils]: 27: Hoare triple {1300#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1301#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:18:03,490 INFO L280 TraceCheckUtils]: 28: Hoare triple {1301#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {1298#false} is VALID [2020-07-29 03:18:03,491 INFO L280 TraceCheckUtils]: 29: Hoare triple {1298#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {1298#false} is VALID [2020-07-29 03:18:03,492 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:03,492 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680898807] [2020-07-29 03:18:03,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:03,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:18:03,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408025247] [2020-07-29 03:18:03,493 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:18:03,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:03,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:18:03,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:18:03,494 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. cyclomatic complexity: 58 Second operand 5 states. [2020-07-29 03:18:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:04,054 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2020-07-29 03:18:04,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:18:04,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:18:04,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:04,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 198 transitions. [2020-07-29 03:18:04,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:18:04,107 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 194 transitions. [2020-07-29 03:18:04,107 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-07-29 03:18:04,107 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-07-29 03:18:04,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 194 transitions. [2020-07-29 03:18:04,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:04,110 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2020-07-29 03:18:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 194 transitions. [2020-07-29 03:18:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-07-29 03:18:04,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:18:04,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 194 transitions. Second operand 139 states. [2020-07-29 03:18:04,123 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 194 transitions. Second operand 139 states. [2020-07-29 03:18:04,123 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand 139 states. [2020-07-29 03:18:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:04,128 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2020-07-29 03:18:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2020-07-29 03:18:04,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:04,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:04,129 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states and 194 transitions. [2020-07-29 03:18:04,129 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states and 194 transitions. [2020-07-29 03:18:04,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:04,134 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2020-07-29 03:18:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2020-07-29 03:18:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:18:04,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:18:04,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:18:04,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:18:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-07-29 03:18:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2020-07-29 03:18:04,139 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2020-07-29 03:18:04,139 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2020-07-29 03:18:04,139 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:18:04,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. [2020-07-29 03:18:04,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:18:04,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:04,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:04,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:18:04,143 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, 1, 1] [2020-07-29 03:18:04,143 INFO L794 eck$LassoCheckResult]: Stem: 1579#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 1467#L-1 havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 1468#L335 assume 0 == ~r1~0; 1572#L336 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1509#L337 assume ~id1~0 >= 0; 1510#L338 assume 0 == ~st1~0; 1556#L339 assume ~send1~0 == ~id1~0; 1469#L340 assume 0 == ~mode1~0 % 256; 1470#L341 assume ~id2~0 >= 0; 1548#L342 assume 0 == ~st2~0; 1456#L343 assume ~send2~0 == ~id2~0; 1457#L344 assume 0 == ~mode2~0 % 256; 1519#L345 assume ~id3~0 >= 0; 1520#L346 assume 0 == ~st3~0; 1571#L347 assume ~send3~0 == ~id3~0; 1505#L348 assume 0 == ~mode3~0 % 256; 1506#L349 assume ~id4~0 >= 0; 1555#L350 assume 0 == ~st4~0; 1497#L351 assume ~send4~0 == ~id4~0; 1498#L352 assume 0 == ~mode4~0 % 256; 1546#L353 assume ~id5~0 >= 0; 1454#L354 assume 0 == ~st5~0; 1455#L355 assume ~send5~0 == ~id5~0; 1517#L356 assume 0 == ~mode5~0 % 256; 1518#L357 assume ~id6~0 >= 0; 1569#L358 assume 0 == ~st6~0; 1503#L359 assume ~send6~0 == ~id6~0; 1504#L360 assume 0 == ~mode6~0 % 256; 1554#L361 assume ~id1~0 != ~id2~0; 1492#L362 assume ~id1~0 != ~id3~0; 1493#L363 assume ~id1~0 != ~id4~0; 1545#L364 assume ~id1~0 != ~id5~0; 1452#L365 assume ~id1~0 != ~id6~0; 1453#L366 assume ~id2~0 != ~id3~0; 1537#L367 assume ~id2~0 != ~id4~0; 1538#L368 assume ~id2~0 != ~id5~0; 1568#L369 assume ~id2~0 != ~id6~0; 1501#L370 assume ~id3~0 != ~id4~0; 1502#L371 assume ~id3~0 != ~id5~0; 1552#L372 assume ~id3~0 != ~id6~0; 1490#L373 assume ~id4~0 != ~id5~0; 1491#L374 assume ~id4~0 != ~id6~0; 1542#L375 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 1543#L335-1 init_#res := init_~tmp~0; 1586#L500 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; 1535#L67 assume !(0 == assume_abort_if_not_~cond); 1536#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 1508#L576-2 [2020-07-29 03:18:04,143 INFO L796 eck$LassoCheckResult]: Loop: 1508#L576-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1532#L129 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1521#L133 assume !(node1_~m1~0 != ~nomsg~0); 1523#L133-1 ~mode1~0 := 0; 1465#L129-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1483#L164 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1485#L167 assume !(node2_~m2~0 != ~nomsg~0); 1495#L167-1 ~mode2~0 := 0; 1478#L164-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1479#L198 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1565#L201 assume !(node3_~m3~0 != ~nomsg~0); 1529#L201-1 ~mode3~0 := 0; 1559#L198-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1526#L232 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1527#L235 assume !(node4_~m4~0 != ~nomsg~0); 1531#L235-1 ~mode4~0 := 0; 1449#L232-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1471#L266 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1473#L269 assume !(node5_~m5~0 != ~nomsg~0); 1461#L269-1 ~mode5~0 := 0; 1575#L266-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1580#L300 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1561#L303 assume !(node6_~m6~0 != ~nomsg~0); 1513#L303-1 ~mode6~0 := 0; 1533#L300-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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1476#L508 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1477#L509 assume ~r1~0 < 6;check_~tmp~1 := 1; 1480#L508-1 check_#res := check_~tmp~1; 1481#L520 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1547#L609 assume !(0 == assert_~arg % 256); 1507#L604 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 1508#L576-2 [2020-07-29 03:18:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2020-07-29 03:18:04,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:04,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694958025] [2020-07-29 03:18:04,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:04,169 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:04,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:04,208 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:04,209 INFO L82 PathProgramCache]: Analyzing trace with hash 911844111, now seen corresponding path program 1 times [2020-07-29 03:18:04,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:04,210 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14453705] [2020-07-29 03:18:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:04,222 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:18:04,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:18:04,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:18:04,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:04,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1786874990, now seen corresponding path program 1 times [2020-07-29 03:18:04,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:18:04,243 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440743659] [2020-07-29 03:18:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:18:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:04,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {1872#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1872#true} is VALID [2020-07-29 03:18:04,321 INFO L280 TraceCheckUtils]: 1: Hoare triple {1872#true} havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1872#true} is VALID [2020-07-29 03:18:04,322 INFO L280 TraceCheckUtils]: 2: Hoare triple {1872#true} assume 0 == ~r1~0; {1872#true} is VALID [2020-07-29 03:18:04,322 INFO L280 TraceCheckUtils]: 3: Hoare triple {1872#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1872#true} is VALID [2020-07-29 03:18:04,322 INFO L280 TraceCheckUtils]: 4: Hoare triple {1872#true} assume ~id1~0 >= 0; {1872#true} is VALID [2020-07-29 03:18:04,322 INFO L280 TraceCheckUtils]: 5: Hoare triple {1872#true} assume 0 == ~st1~0; {1872#true} is VALID [2020-07-29 03:18:04,323 INFO L280 TraceCheckUtils]: 6: Hoare triple {1872#true} assume ~send1~0 == ~id1~0; {1872#true} is VALID [2020-07-29 03:18:04,324 INFO L280 TraceCheckUtils]: 7: Hoare triple {1872#true} assume 0 == ~mode1~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,325 INFO L280 TraceCheckUtils]: 8: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,325 INFO L280 TraceCheckUtils]: 9: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,326 INFO L280 TraceCheckUtils]: 10: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,327 INFO L280 TraceCheckUtils]: 11: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,327 INFO L280 TraceCheckUtils]: 12: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,328 INFO L280 TraceCheckUtils]: 13: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,329 INFO L280 TraceCheckUtils]: 14: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,329 INFO L280 TraceCheckUtils]: 15: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,330 INFO L280 TraceCheckUtils]: 16: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,331 INFO L280 TraceCheckUtils]: 17: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,334 INFO L280 TraceCheckUtils]: 18: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,335 INFO L280 TraceCheckUtils]: 19: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,336 INFO L280 TraceCheckUtils]: 20: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,337 INFO L280 TraceCheckUtils]: 21: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,337 INFO L280 TraceCheckUtils]: 22: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,338 INFO L280 TraceCheckUtils]: 23: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,339 INFO L280 TraceCheckUtils]: 24: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,339 INFO L280 TraceCheckUtils]: 25: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,340 INFO L280 TraceCheckUtils]: 26: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send6~0 == ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,341 INFO L280 TraceCheckUtils]: 27: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode6~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,342 INFO L280 TraceCheckUtils]: 28: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,342 INFO L280 TraceCheckUtils]: 29: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,343 INFO L280 TraceCheckUtils]: 30: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,343 INFO L280 TraceCheckUtils]: 31: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,344 INFO L280 TraceCheckUtils]: 32: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,345 INFO L280 TraceCheckUtils]: 33: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,345 INFO L280 TraceCheckUtils]: 34: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,346 INFO L280 TraceCheckUtils]: 35: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,346 INFO L280 TraceCheckUtils]: 36: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,347 INFO L280 TraceCheckUtils]: 37: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,348 INFO L280 TraceCheckUtils]: 38: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,348 INFO L280 TraceCheckUtils]: 39: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,349 INFO L280 TraceCheckUtils]: 40: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,349 INFO L280 TraceCheckUtils]: 41: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,350 INFO L280 TraceCheckUtils]: 42: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,351 INFO L280 TraceCheckUtils]: 43: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,351 INFO L280 TraceCheckUtils]: 44: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,352 INFO L280 TraceCheckUtils]: 45: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,353 INFO L280 TraceCheckUtils]: 46: Hoare triple {1874#(= (* 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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,353 INFO L280 TraceCheckUtils]: 47: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:18:04,354 INFO L280 TraceCheckUtils]: 48: Hoare triple {1874#(= (* 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,355 INFO L280 TraceCheckUtils]: 49: Hoare triple {1873#false} assume !(node1_~m1~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:18:04,355 INFO L280 TraceCheckUtils]: 50: Hoare triple {1873#false} ~mode1~0 := 0; {1873#false} is VALID [2020-07-29 03:18:04,355 INFO L280 TraceCheckUtils]: 51: Hoare triple {1873#false} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,356 INFO L280 TraceCheckUtils]: 52: Hoare triple {1873#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,356 INFO L280 TraceCheckUtils]: 53: Hoare triple {1873#false} assume !(node2_~m2~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:18:04,356 INFO L280 TraceCheckUtils]: 54: Hoare triple {1873#false} ~mode2~0 := 0; {1873#false} is VALID [2020-07-29 03:18:04,356 INFO L280 TraceCheckUtils]: 55: Hoare triple {1873#false} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,356 INFO L280 TraceCheckUtils]: 56: Hoare triple {1873#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,357 INFO L280 TraceCheckUtils]: 57: Hoare triple {1873#false} assume !(node3_~m3~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:18:04,357 INFO L280 TraceCheckUtils]: 58: Hoare triple {1873#false} ~mode3~0 := 0; {1873#false} is VALID [2020-07-29 03:18:04,357 INFO L280 TraceCheckUtils]: 59: Hoare triple {1873#false} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,358 INFO L280 TraceCheckUtils]: 60: Hoare triple {1873#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,358 INFO L280 TraceCheckUtils]: 61: Hoare triple {1873#false} assume !(node4_~m4~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:18:04,358 INFO L280 TraceCheckUtils]: 62: Hoare triple {1873#false} ~mode4~0 := 0; {1873#false} is VALID [2020-07-29 03:18:04,358 INFO L280 TraceCheckUtils]: 63: Hoare triple {1873#false} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,358 INFO L280 TraceCheckUtils]: 64: Hoare triple {1873#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,359 INFO L280 TraceCheckUtils]: 65: Hoare triple {1873#false} assume !(node5_~m5~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:18:04,359 INFO L280 TraceCheckUtils]: 66: Hoare triple {1873#false} ~mode5~0 := 0; {1873#false} is VALID [2020-07-29 03:18:04,359 INFO L280 TraceCheckUtils]: 67: Hoare triple {1873#false} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,359 INFO L280 TraceCheckUtils]: 68: Hoare triple {1873#false} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:18:04,359 INFO L280 TraceCheckUtils]: 69: Hoare triple {1873#false} assume !(node6_~m6~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:18:04,360 INFO L280 TraceCheckUtils]: 70: Hoare triple {1873#false} ~mode6~0 := 0; {1873#false} is VALID [2020-07-29 03:18:04,360 INFO L280 TraceCheckUtils]: 71: Hoare triple {1873#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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1873#false} is VALID [2020-07-29 03:18:04,360 INFO L280 TraceCheckUtils]: 72: Hoare triple {1873#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1873#false} is VALID [2020-07-29 03:18:04,360 INFO L280 TraceCheckUtils]: 73: Hoare triple {1873#false} assume ~r1~0 < 6;check_~tmp~1 := 1; {1873#false} is VALID [2020-07-29 03:18:04,360 INFO L280 TraceCheckUtils]: 74: Hoare triple {1873#false} check_#res := check_~tmp~1; {1873#false} is VALID [2020-07-29 03:18:04,361 INFO L280 TraceCheckUtils]: 75: Hoare triple {1873#false} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1873#false} is VALID [2020-07-29 03:18:04,361 INFO L280 TraceCheckUtils]: 76: Hoare triple {1873#false} assume !(0 == assert_~arg % 256); {1873#false} is VALID [2020-07-29 03:18:04,361 INFO L280 TraceCheckUtils]: 77: Hoare triple {1873#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {1873#false} is VALID [2020-07-29 03:18:04,373 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:04,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440743659] [2020-07-29 03:18:04,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:18:04,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:18:04,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843989482] [2020-07-29 03:18:04,904 WARN L193 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2020-07-29 03:18:05,462 WARN L193 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 134 [2020-07-29 03:18:05,476 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:05,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:05,478 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:05,478 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:05,478 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:18:05,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:05,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:05,479 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:05,479 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:18:05,479 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:05,479 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:05,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:05,576 INFO L141 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:05,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:05,589 INFO L141 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:05,593 INFO L141 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:05,602 INFO L141 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:05,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:05,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:05,635 INFO L141 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:05,641 INFO L141 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:05,649 INFO L141 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:05,653 INFO L141 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:05,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:05,662 INFO L141 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:05,666 INFO L141 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:05,675 INFO L141 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:05,679 INFO L141 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:05,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:05,776 INFO L141 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:05,779 INFO L141 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:05,789 INFO L141 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:05,797 INFO L141 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:05,805 INFO L141 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:05,814 INFO L141 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:05,820 INFO L141 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:05,824 INFO L141 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:05,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:05,840 INFO L141 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:05,844 INFO L141 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:05,851 INFO L141 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:05,856 INFO L141 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:05,859 INFO L141 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:05,862 INFO L141 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:05,870 INFO L141 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:05,873 INFO L141 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:05,877 INFO L141 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:05,881 INFO L141 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:05,885 INFO L141 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:06,630 WARN L193 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:18:07,241 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:18:07,519 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:07,520 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:07,528 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:18:07,529 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:07,566 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:18:07,566 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:18:07,719 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:18:07,721 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:18:07,721 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:18:07,721 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:18:07,721 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:18:07,722 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:18:07,722 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:07,722 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:18:07,722 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:18:07,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:18:07,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:18:07,722 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:18:07,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,796 INFO L141 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:07,801 INFO L141 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:07,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,821 INFO L141 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:07,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,844 INFO L141 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:07,849 INFO L141 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:07,857 INFO L141 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:07,864 INFO L141 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:07,870 INFO L141 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:07,876 INFO L141 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:07,882 INFO L141 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:07,885 INFO L141 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:07,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,893 INFO L141 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:07,901 INFO L141 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:07,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,912 INFO L141 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:07,920 INFO L141 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:07,924 INFO L141 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:07,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,942 INFO L141 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:07,952 INFO L141 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:07,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,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:07,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:18:07,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:07,990 INFO L141 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:08,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:08,052 INFO L141 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:08,056 INFO L141 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:08,061 INFO L141 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:09,056 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:18:09,596 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:18:09,725 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:18:09,731 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:18:09,740 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,743 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:09,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:09,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:09,752 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:18:09,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:18:09,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:18:09,786 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:18:09,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:09,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:09,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:09,814 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:18:09,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,848 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:18:09,848 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:18:09,860 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:18:09,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:09,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,903 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,903 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:09,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:09,906 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:18:09,931 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:09,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:09,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:09,934 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:18:09,958 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:09,959 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:18:09,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:18:09,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:09,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:09,991 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:09,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:09,992 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:09,992 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:18:09,992 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:09,994 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:18:09,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:09,999 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:18:10,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,021 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:18:10,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:18:10,034 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:18:10,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,061 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,061 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,063 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) [2020-07-29 03:18:10,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,090 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:18:10,090 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:18:10,093 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:18:10,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,119 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,121 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,121 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,124 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:18:10,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,190 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,190 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,191 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,191 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,193 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,215 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,217 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,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:18:10,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,245 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:18:10,245 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:18:10,250 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:10,293 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,299 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,329 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,329 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:18:10,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:18:10,358 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:18:10,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:18:10,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:18:10,359 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:18:10,359 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:18:10,359 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:18:10,361 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:18:10,375 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:18:10,375 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:18:10,381 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:18:10,381 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:18:10,381 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:18:10,382 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:18:10,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:18:10,451 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite4, node3_#t~ite5, 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~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite8, node5_#t~ite9, 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;" "havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0 != ~nomsg~0);" "~mode6~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;~p6_old~0 := ~p6_new~0;~p6_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 + ~st6~0 <= 1;" "assume ~r1~0 < 6;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;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~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45;" [2020-07-29 03:18:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:18:10,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:10,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:18:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:10,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:10,641 INFO L280 TraceCheckUtils]: 0: Hoare triple {1875#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;~alive1~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;~alive2~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;~alive3~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;~alive4~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;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1875#unseeded} is VALID [2020-07-29 03:18:10,643 INFO L280 TraceCheckUtils]: 1: Hoare triple {1875#unseeded} havoc main_#res;havoc 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~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,645 INFO L280 TraceCheckUtils]: 2: Hoare triple {1875#unseeded} assume 0 == ~r1~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,646 INFO L280 TraceCheckUtils]: 3: Hoare triple {1875#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1875#unseeded} is VALID [2020-07-29 03:18:10,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {1875#unseeded} assume ~id1~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,647 INFO L280 TraceCheckUtils]: 5: Hoare triple {1875#unseeded} assume 0 == ~st1~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,648 INFO L280 TraceCheckUtils]: 6: Hoare triple {1875#unseeded} assume ~send1~0 == ~id1~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,649 INFO L280 TraceCheckUtils]: 7: Hoare triple {1875#unseeded} assume 0 == ~mode1~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:18:10,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {1875#unseeded} assume ~id2~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,650 INFO L280 TraceCheckUtils]: 9: Hoare triple {1875#unseeded} assume 0 == ~st2~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {1875#unseeded} assume ~send2~0 == ~id2~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,651 INFO L280 TraceCheckUtils]: 11: Hoare triple {1875#unseeded} assume 0 == ~mode2~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:18:10,652 INFO L280 TraceCheckUtils]: 12: Hoare triple {1875#unseeded} assume ~id3~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,653 INFO L280 TraceCheckUtils]: 13: Hoare triple {1875#unseeded} assume 0 == ~st3~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,653 INFO L280 TraceCheckUtils]: 14: Hoare triple {1875#unseeded} assume ~send3~0 == ~id3~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,654 INFO L280 TraceCheckUtils]: 15: Hoare triple {1875#unseeded} assume 0 == ~mode3~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:18:10,654 INFO L280 TraceCheckUtils]: 16: Hoare triple {1875#unseeded} assume ~id4~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,655 INFO L280 TraceCheckUtils]: 17: Hoare triple {1875#unseeded} assume 0 == ~st4~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,656 INFO L280 TraceCheckUtils]: 18: Hoare triple {1875#unseeded} assume ~send4~0 == ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,657 INFO L280 TraceCheckUtils]: 19: Hoare triple {1875#unseeded} assume 0 == ~mode4~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:18:10,657 INFO L280 TraceCheckUtils]: 20: Hoare triple {1875#unseeded} assume ~id5~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,658 INFO L280 TraceCheckUtils]: 21: Hoare triple {1875#unseeded} assume 0 == ~st5~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,659 INFO L280 TraceCheckUtils]: 22: Hoare triple {1875#unseeded} assume ~send5~0 == ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,659 INFO L280 TraceCheckUtils]: 23: Hoare triple {1875#unseeded} assume 0 == ~mode5~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:18:10,660 INFO L280 TraceCheckUtils]: 24: Hoare triple {1875#unseeded} assume ~id6~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,661 INFO L280 TraceCheckUtils]: 25: Hoare triple {1875#unseeded} assume 0 == ~st6~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,661 INFO L280 TraceCheckUtils]: 26: Hoare triple {1875#unseeded} assume ~send6~0 == ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,662 INFO L280 TraceCheckUtils]: 27: Hoare triple {1875#unseeded} assume 0 == ~mode6~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:18:10,663 INFO L280 TraceCheckUtils]: 28: Hoare triple {1875#unseeded} assume ~id1~0 != ~id2~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,663 INFO L280 TraceCheckUtils]: 29: Hoare triple {1875#unseeded} assume ~id1~0 != ~id3~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,664 INFO L280 TraceCheckUtils]: 30: Hoare triple {1875#unseeded} assume ~id1~0 != ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,665 INFO L280 TraceCheckUtils]: 31: Hoare triple {1875#unseeded} assume ~id1~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,665 INFO L280 TraceCheckUtils]: 32: Hoare triple {1875#unseeded} assume ~id1~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,666 INFO L280 TraceCheckUtils]: 33: Hoare triple {1875#unseeded} assume ~id2~0 != ~id3~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,666 INFO L280 TraceCheckUtils]: 34: Hoare triple {1875#unseeded} assume ~id2~0 != ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,667 INFO L280 TraceCheckUtils]: 35: Hoare triple {1875#unseeded} assume ~id2~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,668 INFO L280 TraceCheckUtils]: 36: Hoare triple {1875#unseeded} assume ~id2~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,668 INFO L280 TraceCheckUtils]: 37: Hoare triple {1875#unseeded} assume ~id3~0 != ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,669 INFO L280 TraceCheckUtils]: 38: Hoare triple {1875#unseeded} assume ~id3~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,669 INFO L280 TraceCheckUtils]: 39: Hoare triple {1875#unseeded} assume ~id3~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,670 INFO L280 TraceCheckUtils]: 40: Hoare triple {1875#unseeded} assume ~id4~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,671 INFO L280 TraceCheckUtils]: 41: Hoare triple {1875#unseeded} assume ~id4~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,671 INFO L280 TraceCheckUtils]: 42: Hoare triple {1875#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1875#unseeded} is VALID [2020-07-29 03:18:10,672 INFO L280 TraceCheckUtils]: 43: Hoare triple {1875#unseeded} init_#res := init_~tmp~0; {1875#unseeded} is VALID [2020-07-29 03:18:10,673 INFO L280 TraceCheckUtils]: 44: Hoare triple {1875#unseeded} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;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; {1875#unseeded} is VALID [2020-07-29 03:18:10,673 INFO L280 TraceCheckUtils]: 45: Hoare triple {1875#unseeded} assume !(0 == assume_abort_if_not_~cond); {1875#unseeded} is VALID [2020-07-29 03:18:10,674 INFO L280 TraceCheckUtils]: 46: Hoare triple {1875#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;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1875#unseeded} is VALID [2020-07-29 03:18:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:10,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:18:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:18:10,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:18:10,788 INFO L280 TraceCheckUtils]: 0: Hoare triple {1878#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23))} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,789 INFO L280 TraceCheckUtils]: 1: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ 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 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,790 INFO L280 TraceCheckUtils]: 2: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,791 INFO L280 TraceCheckUtils]: 3: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,792 INFO L280 TraceCheckUtils]: 4: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,793 INFO L280 TraceCheckUtils]: 5: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,793 INFO L280 TraceCheckUtils]: 6: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,794 INFO L280 TraceCheckUtils]: 7: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,798 INFO L280 TraceCheckUtils]: 12: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,799 INFO L280 TraceCheckUtils]: 13: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,799 INFO L280 TraceCheckUtils]: 14: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,800 INFO L280 TraceCheckUtils]: 15: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,801 INFO L280 TraceCheckUtils]: 16: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,802 INFO L280 TraceCheckUtils]: 17: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,803 INFO L280 TraceCheckUtils]: 18: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,803 INFO L280 TraceCheckUtils]: 19: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,804 INFO L280 TraceCheckUtils]: 20: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,805 INFO L280 TraceCheckUtils]: 21: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,806 INFO L280 TraceCheckUtils]: 22: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node6_~m6~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,807 INFO L280 TraceCheckUtils]: 23: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode6~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,807 INFO L280 TraceCheckUtils]: 24: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ 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;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,808 INFO L280 TraceCheckUtils]: 25: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,809 INFO L280 TraceCheckUtils]: 26: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 6;check_~tmp~1 := 1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,810 INFO L280 TraceCheckUtils]: 27: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,811 INFO L280 TraceCheckUtils]: 28: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,812 INFO L280 TraceCheckUtils]: 29: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:18:10,814 INFO L280 TraceCheckUtils]: 30: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {1888#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:18:10,814 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:10,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:10,853 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:10,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:10,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:10,860 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:18:10,861 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56 Second operand 3 states. [2020-07-29 03:18:11,395 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56. Second operand 3 states. Result 231 states and 342 transitions. Complement of second has 4 states. [2020-07-29 03:18:11,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 03:18:11,396 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:11,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2020-07-29 03:18:11,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:11,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:11,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:18:11,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:11,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:18:11,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:18:11,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. [2020-07-29 03:18:11,417 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:11,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:11,421 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2020-07-29 03:18:11,509 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 92 examples of accepted words. [2020-07-29 03:18:11,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:18:11,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:18:11,515 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:18:11,515 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2020-07-29 03:18:11,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2020-07-29 03:18:11,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:11,516 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:18:11,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:11,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:11,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 231 letters. Loop has 231 letters. [2020-07-29 03:18:11,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 231 letters. Loop has 231 letters. [2020-07-29 03:18:11,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 231 letters. Loop has 231 letters. [2020-07-29 03:18:11,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 139 letters. Loop has 139 letters. [2020-07-29 03:18:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 139 letters. Loop has 139 letters. [2020-07-29 03:18:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 139 letters. Loop has 139 letters. [2020-07-29 03:18:11,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:11,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:18:11,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:11,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:11,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:11,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:11,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:11,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:11,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:18:11,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:18:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:18:11,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:18:11,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:18:11,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:18:11,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:18:11,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:18:11,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:18:11,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:11,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:11,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:11,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:11,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:11,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:11,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:18:11,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:18:11,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:18:11,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:18:11,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:18:11,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:18:11,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:18:11,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:18:11,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:18:11,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:11,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:11,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:11,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:18:11,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:18:11,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:18:11,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:18:11,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:18:11,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:18:11,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:18:11,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:18:11,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:18:11,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:11,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:11,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:11,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:11,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:11,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:11,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:11,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:18:11,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:18:11,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:18:11,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:18:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:18:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:18:11,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:18:11,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:18:11,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:18:11,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:18:11,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:18:11,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:18:11,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:11,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:11,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:11,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:18:11,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:18:11,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:18:11,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:18:11,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:18:11,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:18:11,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:18:11,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:18:11,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:18:11,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:18:11,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:18:11,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:18:11,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:11,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:11,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:18:11,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:18:11,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:18:11,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:18:11,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:18:11,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:18:11,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:18:11,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:11,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:11,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:11,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:11,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:11,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:11,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:18:11,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:18:11,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:18:11,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:18:11,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:18:11,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:18:11,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:11,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:11,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:18:11,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:11,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:18:11,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:11,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:11,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:18:11,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:11,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:11,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:18:11,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:11,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:11,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:11,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:18:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:18:11,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:18:11,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:11,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:18:11,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:18:11,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:18:11,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:18:11,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:18:11,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:18:11,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:11,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:11,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:18:11,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 32 letters. [2020-07-29 03:18:11,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 32 letters. [2020-07-29 03:18:11,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 32 letters. [2020-07-29 03:18:11,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:18:11,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:18:11,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:18:11,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:18:11,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:18:11,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:18:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:18:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:18:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:18:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:18:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:18:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:18:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:18:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:18:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:18:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:18:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:18:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:18:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:18:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:18:11,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:18:11,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:18:11,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:18:11,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:18:11,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:18:11,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:18:11,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:18:11,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:18:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:18:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:18:11,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:18:11,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:18:11,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:18:11,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:18:11,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:18:11,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:18:11,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:18:11,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:18:11,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:18:11,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:18:11,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:18:11,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:18:11,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:18:11,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:18:11,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:18:11,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:18:11,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:18:11,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:18:11,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:11,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:11,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:18:11,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 32 letters. [2020-07-29 03:18:11,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 32 letters. [2020-07-29 03:18:11,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 32 letters. [2020-07-29 03:18:11,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:11,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:11,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:11,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:18:11,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:18:11,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:18:11,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:11,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:11,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:18:11,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:18:11,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:18:11,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:18:11,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:11,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:11,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:18:11,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 34 letters. [2020-07-29 03:18:11,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 34 letters. [2020-07-29 03:18:11,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 34 letters. [2020-07-29 03:18:11,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:11,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:11,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:11,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:18:11,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:18:11,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:18:11,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:18:11,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:18:11,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:18:11,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:11,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:11,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:18:11,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:18:11,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:18:11,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:18:11,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:11,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:11,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:18:11,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:18:11,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:18:11,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:18:11,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:18:11,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:18:11,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:18:11,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:11,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:11,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:18:11,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:11,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:11,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:18:11,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:11,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:11,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:18:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:11,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:11,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:18:11,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:18:11,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:18:11,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:18:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:18:11,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:18:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:18:11,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:18:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:18:11,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:18:11,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:11,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:11,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:18:11,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:18:11,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:18:11,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:18:11,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:11,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:11,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:18:11,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:18:11,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:18:11,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:18:11,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:18:11,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:18:11,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:18:11,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:18:11,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:18:11,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:18:11,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:11,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:11,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:18:11,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:11,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:11,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:18:11,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,716 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:18:11,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:18:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-29 03:18:11,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:18:11,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 78 letters. Loop has 31 letters. [2020-07-29 03:18:11,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 62 letters. [2020-07-29 03:18:11,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:18:11,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2020-07-29 03:18:11,733 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:11,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2020-07-29 03:18:11,733 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:11,733 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:11,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:11,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:11,734 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:11,734 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:11,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:18:11,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:18:11,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:18:11,735 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:18:11,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:18:11,736 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:18:11,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:18:11,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:18:11,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:18:11,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:18:11,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:11,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:18:11,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:18:11,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:18:11,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:18:11,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:18:11,835 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:11,835 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:11,835 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:18:11,835 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:18:11,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:18:11,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:18:11,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:18:11,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:18:11 BoogieIcfgContainer [2020-07-29 03:18:11,843 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:18:11,843 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:18:11,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:18:11,844 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:18:11,845 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:00" (3/4) ... [2020-07-29 03:18:11,848 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:18:11,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:18:11,851 INFO L168 Benchmark]: Toolchain (without parser) took 12921.47 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 392.2 MB). Free memory was 961.6 MB in the beginning and 1.2 GB in the end (delta: -261.6 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:11,852 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:11,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 640.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:11,858 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:11,859 INFO L168 Benchmark]: Boogie Preprocessor took 89.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:11,860 INFO L168 Benchmark]: RCFGBuilder took 1132.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:11,861 INFO L168 Benchmark]: BuchiAutomizer took 10951.90 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 274.7 MB). Free memory was 993.2 MB in the beginning and 1.2 GB in the end (delta: -230.0 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:18:11,861 INFO L168 Benchmark]: Witness Printer took 5.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:18:11,868 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 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 640.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 117.4 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -138.3 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1132.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10951.90 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 274.7 MB). Free memory was 993.2 MB in the beginning and 1.2 GB in the end (delta: -230.0 MB). Peak memory consumption was 44.8 MB. Max. memory is 11.5 GB. * Witness Printer took 5.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 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 10.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.5s. Construction of modules took 0.0s. Büchi inclusion checks took 2.8s. 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 139 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 863 SDtfs, 314 SDslu, 1382 SDs, 0 SdLazy, 26 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax138 hnf108 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...