./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.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_floodmax.4.1.ufo.BOUNDED-8.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 816c75623a5600dd32e7650fd296bf6a94865eab .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:15:00,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:15:00,880 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:15:00,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:15:00,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:15:00,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:15:00,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:15:00,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:15:00,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:15:00,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:15:00,903 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:15:00,904 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:15:00,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:15:00,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:15:00,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:15:00,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:15:00,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:15:00,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:15:00,919 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:15:00,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:15:00,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:15:00,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:15:00,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:15:00,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:15:00,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:15:00,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:15:00,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:15:00,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:15:00,933 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:15:00,934 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:15:00,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:15:00,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:15:00,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:15:00,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:15:00,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:15:00,939 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:15:00,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:15:00,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:15:00,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:15:00,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:15:00,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:15:00,944 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:15:00,960 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:15:00,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:15:00,962 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:15:00,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:15:00,963 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:15:00,963 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:15:00,964 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:15:00,964 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:15:00,964 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:15:00,965 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:15:00,965 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:15:00,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:15:00,965 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:15:00,966 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:15:00,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:15:00,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:15:00,967 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:15:00,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:15:00,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:15:00,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:15:00,968 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:15:00,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:15:00,968 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:15:00,968 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:15:00,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:15:00,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:15:00,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:15:00,969 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:15:00,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:15:00,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:15:00,970 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:15:00,971 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:15:00,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:15:00,972 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 -> 816c75623a5600dd32e7650fd296bf6a94865eab [2020-07-29 03:15:01,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:15:01,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:15:01,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:15:01,338 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:15:01,340 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:15:01,341 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2020-07-29 03:15:01,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f97d3a3/c8a50a45149e4bd29c88e49a16e4a439/FLAGe2fd691e6 [2020-07-29 03:15:01,978 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:15:01,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2020-07-29 03:15:02,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f97d3a3/c8a50a45149e4bd29c88e49a16e4a439/FLAGe2fd691e6 [2020-07-29 03:15:02,217 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4f97d3a3/c8a50a45149e4bd29c88e49a16e4a439 [2020-07-29 03:15:02,220 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:15:02,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:15:02,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:15:02,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:15:02,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:15:02,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:02,233 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d50db84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02, skipping insertion in model container [2020-07-29 03:15:02,234 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:02,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:15:02,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:15:02,771 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:15:02,791 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:15:02,922 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:15:02,951 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:15:02,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02 WrapperNode [2020-07-29 03:15:02,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:15:02,953 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:15:02,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:15:02,954 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:15:02,961 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:15:02" (1/1) ... [2020-07-29 03:15:02,981 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:15:02" (1/1) ... [2020-07-29 03:15:03,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:15:03,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:15:03,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:15:03,064 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:15:03,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,097 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (1/1) ... [2020-07-29 03:15:03,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:15:03,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:15:03,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:15:03,130 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:15:03,131 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (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:15:03,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:15:03,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:15:05,366 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:15:05,366 INFO L295 CfgBuilder]: Removed 21 assume(true) statements. [2020-07-29 03:15:05,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:15:05 BoogieIcfgContainer [2020-07-29 03:15:05,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:15:05,374 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:15:05,375 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:15:05,378 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:15:05,380 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:15:05,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:15:02" (1/3) ... [2020-07-29 03:15:05,381 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f10466e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:15:05, skipping insertion in model container [2020-07-29 03:15:05,382 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:15:05,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:15:02" (2/3) ... [2020-07-29 03:15:05,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5f10466e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:15:05, skipping insertion in model container [2020-07-29 03:15:05,383 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:15:05,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:15:05" (3/3) ... [2020-07-29 03:15:05,385 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.BOUNDED-8.pals.c [2020-07-29 03:15:05,440 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:15:05,440 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:15:05,440 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:15:05,441 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:15:05,442 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:15:05,442 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:15:05,442 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:15:05,443 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:15:05,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states. [2020-07-29 03:15:05,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2020-07-29 03:15:05,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:05,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:05,573 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:15:05,574 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] [2020-07-29 03:15:05,574 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:15:05,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 291 states. [2020-07-29 03:15:05,607 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2020-07-29 03:15:05,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:05,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:05,611 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:15:05,612 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] [2020-07-29 03:15:05,623 INFO L794 eck$LassoCheckResult]: Stem: 112#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; 15#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 29#L439true assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 27#L450true init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 227#L460true assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 226#L471true init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 281#L481true assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 280#L492true init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 200#L502true assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 198#L513true init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 108#L523true assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 107#L534true init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 13#L544true assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 12#L555true init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 64#L565true assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 62#L576true init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 262#L586true assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 261#L597true init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 170#L607true assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 169#L618true init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 217#L628true assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 82#L639true init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 127#L649true assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 126#L660true init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 34#L670true assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 33#L681true init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 236#L691true assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 235#L702true init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 292#L712true assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 290#L723true init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 208#L733true assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 207#L744true init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 115#L754true assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 114#L765true init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 22#L775true assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 20#L786true init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 71#L796true assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 70#L807true init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 269#L817true assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 267#L828true init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 180#L838true assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 176#L849true init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 90#L859true assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 89#L870true init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 148#L880true assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 147#L891true init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 52#L901true assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 51#L912true init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 252#L922true assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 251#L933true init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 164#L943true assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 152#L943-1true init_#res := init_~tmp___23~0; 159#L1064true main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; 117#L66true assume !(0 == assume_abort_if_not_~cond); 21#L65true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 210#L1201-2true [2020-07-29 03:15:05,625 INFO L796 eck$LassoCheckResult]: Loop: 210#L1201-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 97#L154true assume !(0 != ~mode1~0 % 256); 4#L186true assume !(~r1~0 < 3); 24#L186-1true ~mode1~0 := 1; 119#L154-2true havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 54#L207true assume !(0 != ~mode2~0 % 256); 254#L239true assume !(~r2~0 < 3); 272#L239-1true ~mode2~0 := 1; 74#L207-2true havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 186#L260true assume !(0 != ~mode3~0 % 256); 96#L292true assume !(~r3~0 < 3); 93#L292-1true ~mode3~0 := 1; 178#L260-2true havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 132#L313true assume !(0 != ~mode4~0 % 256); 39#L345true assume !(~r4~0 < 3); 40#L345-1true ~mode4~0 := 1; 134#L313-2true ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 36#L1072true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 37#L1072-1true check_#res := check_~tmp~1; 188#L1124true main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 118#L1244true assume !(0 == assert_~arg % 256); 78#L1239true main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 210#L1201-2true [2020-07-29 03:15:05,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:05,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1972521662, now seen corresponding path program 1 times [2020-07-29 03:15:05,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:05,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411654453] [2020-07-29 03:15:05,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:06,118 INFO L280 TraceCheckUtils]: 0: Hoare triple {295#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; {295#true} is VALID [2020-07-29 03:15:06,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {295#true} is VALID [2020-07-29 03:15:06,120 INFO L280 TraceCheckUtils]: 2: Hoare triple {295#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,120 INFO L280 TraceCheckUtils]: 3: Hoare triple {295#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {295#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,121 INFO L280 TraceCheckUtils]: 5: Hoare triple {295#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,121 INFO L280 TraceCheckUtils]: 6: Hoare triple {295#true} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,122 INFO L280 TraceCheckUtils]: 7: Hoare triple {295#true} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,122 INFO L280 TraceCheckUtils]: 8: Hoare triple {295#true} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,123 INFO L280 TraceCheckUtils]: 9: Hoare triple {295#true} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,123 INFO L280 TraceCheckUtils]: 10: Hoare triple {295#true} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,124 INFO L280 TraceCheckUtils]: 11: Hoare triple {295#true} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,124 INFO L280 TraceCheckUtils]: 12: Hoare triple {295#true} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,125 INFO L280 TraceCheckUtils]: 13: Hoare triple {295#true} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,125 INFO L280 TraceCheckUtils]: 14: Hoare triple {295#true} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,125 INFO L280 TraceCheckUtils]: 15: Hoare triple {295#true} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,126 INFO L280 TraceCheckUtils]: 16: Hoare triple {295#true} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,126 INFO L280 TraceCheckUtils]: 17: Hoare triple {295#true} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,127 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#true} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,127 INFO L280 TraceCheckUtils]: 19: Hoare triple {295#true} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,128 INFO L280 TraceCheckUtils]: 20: Hoare triple {295#true} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,128 INFO L280 TraceCheckUtils]: 21: Hoare triple {295#true} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,129 INFO L280 TraceCheckUtils]: 22: Hoare triple {295#true} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,129 INFO L280 TraceCheckUtils]: 23: Hoare triple {295#true} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,130 INFO L280 TraceCheckUtils]: 24: Hoare triple {295#true} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,130 INFO L280 TraceCheckUtils]: 25: Hoare triple {295#true} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,131 INFO L280 TraceCheckUtils]: 26: Hoare triple {295#true} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,131 INFO L280 TraceCheckUtils]: 27: Hoare triple {295#true} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,132 INFO L280 TraceCheckUtils]: 28: Hoare triple {295#true} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,132 INFO L280 TraceCheckUtils]: 29: Hoare triple {295#true} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,132 INFO L280 TraceCheckUtils]: 30: Hoare triple {295#true} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,133 INFO L280 TraceCheckUtils]: 31: Hoare triple {295#true} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,133 INFO L280 TraceCheckUtils]: 32: Hoare triple {295#true} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,134 INFO L280 TraceCheckUtils]: 33: Hoare triple {295#true} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,134 INFO L280 TraceCheckUtils]: 34: Hoare triple {295#true} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,135 INFO L280 TraceCheckUtils]: 35: Hoare triple {295#true} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,135 INFO L280 TraceCheckUtils]: 36: Hoare triple {295#true} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,136 INFO L280 TraceCheckUtils]: 37: Hoare triple {295#true} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,136 INFO L280 TraceCheckUtils]: 38: Hoare triple {295#true} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,136 INFO L280 TraceCheckUtils]: 39: Hoare triple {295#true} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,137 INFO L280 TraceCheckUtils]: 40: Hoare triple {295#true} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,137 INFO L280 TraceCheckUtils]: 41: Hoare triple {295#true} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,138 INFO L280 TraceCheckUtils]: 42: Hoare triple {295#true} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,138 INFO L280 TraceCheckUtils]: 43: Hoare triple {295#true} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,139 INFO L280 TraceCheckUtils]: 44: Hoare triple {295#true} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,139 INFO L280 TraceCheckUtils]: 45: Hoare triple {295#true} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,140 INFO L280 TraceCheckUtils]: 46: Hoare triple {295#true} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,140 INFO L280 TraceCheckUtils]: 47: Hoare triple {295#true} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,140 INFO L280 TraceCheckUtils]: 48: Hoare triple {295#true} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {295#true} is VALID [2020-07-29 03:15:06,141 INFO L280 TraceCheckUtils]: 49: Hoare triple {295#true} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {295#true} is VALID [2020-07-29 03:15:06,142 INFO L280 TraceCheckUtils]: 50: Hoare triple {295#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {297#(= 0 ULTIMATE.start_init_~tmp___23~0)} is VALID [2020-07-29 03:15:06,143 INFO L280 TraceCheckUtils]: 51: Hoare triple {297#(= 0 ULTIMATE.start_init_~tmp___23~0)} init_#res := init_~tmp___23~0; {298#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:15:06,145 INFO L280 TraceCheckUtils]: 52: Hoare triple {298#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; {299#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:15:06,145 INFO L280 TraceCheckUtils]: 53: Hoare triple {299#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {296#false} is VALID [2020-07-29 03:15:06,146 INFO L280 TraceCheckUtils]: 54: Hoare triple {296#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {296#false} is VALID [2020-07-29 03:15:06,154 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:15:06,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411654453] [2020-07-29 03:15:06,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:06,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:06,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256214388] [2020-07-29 03:15:06,164 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:15:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash -11982095, now seen corresponding path program 1 times [2020-07-29 03:15:06,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:06,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256943401] [2020-07-29 03:15:06,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:06,301 INFO L280 TraceCheckUtils]: 0: Hoare triple {300#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; {300#true} is VALID [2020-07-29 03:15:06,301 INFO L280 TraceCheckUtils]: 1: Hoare triple {300#true} assume !(0 != ~mode1~0 % 256); {300#true} is VALID [2020-07-29 03:15:06,302 INFO L280 TraceCheckUtils]: 2: Hoare triple {300#true} assume !(~r1~0 < 3); {300#true} is VALID [2020-07-29 03:15:06,302 INFO L280 TraceCheckUtils]: 3: Hoare triple {300#true} ~mode1~0 := 1; {300#true} is VALID [2020-07-29 03:15:06,303 INFO L280 TraceCheckUtils]: 4: Hoare triple {300#true} havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; {300#true} is VALID [2020-07-29 03:15:06,303 INFO L280 TraceCheckUtils]: 5: Hoare triple {300#true} assume !(0 != ~mode2~0 % 256); {300#true} is VALID [2020-07-29 03:15:06,303 INFO L280 TraceCheckUtils]: 6: Hoare triple {300#true} assume !(~r2~0 < 3); {300#true} is VALID [2020-07-29 03:15:06,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#true} ~mode2~0 := 1; {300#true} is VALID [2020-07-29 03:15:06,304 INFO L280 TraceCheckUtils]: 8: Hoare triple {300#true} havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; {300#true} is VALID [2020-07-29 03:15:06,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {300#true} assume !(0 != ~mode3~0 % 256); {300#true} is VALID [2020-07-29 03:15:06,304 INFO L280 TraceCheckUtils]: 10: Hoare triple {300#true} assume !(~r3~0 < 3); {300#true} is VALID [2020-07-29 03:15:06,305 INFO L280 TraceCheckUtils]: 11: Hoare triple {300#true} ~mode3~0 := 1; {300#true} is VALID [2020-07-29 03:15:06,305 INFO L280 TraceCheckUtils]: 12: Hoare triple {300#true} havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; {300#true} is VALID [2020-07-29 03:15:06,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {300#true} assume !(0 != ~mode4~0 % 256); {300#true} is VALID [2020-07-29 03:15:06,306 INFO L280 TraceCheckUtils]: 14: Hoare triple {300#true} assume !(~r4~0 < 3); {300#true} is VALID [2020-07-29 03:15:06,307 INFO L280 TraceCheckUtils]: 15: Hoare triple {300#true} ~mode4~0 := 1; {300#true} is VALID [2020-07-29 03:15:06,307 INFO L280 TraceCheckUtils]: 16: Hoare triple {300#true} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {300#true} is VALID [2020-07-29 03:15:06,308 INFO L280 TraceCheckUtils]: 17: Hoare triple {300#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; {302#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:15:06,310 INFO L280 TraceCheckUtils]: 18: Hoare triple {302#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {303#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:15:06,312 INFO L280 TraceCheckUtils]: 19: Hoare triple {303#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {304#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:15:06,313 INFO L280 TraceCheckUtils]: 20: Hoare triple {304#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {301#false} is VALID [2020-07-29 03:15:06,313 INFO L280 TraceCheckUtils]: 21: Hoare triple {301#false} main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; {301#false} is VALID [2020-07-29 03:15:06,315 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:15:06,315 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256943401] [2020-07-29 03:15:06,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:06,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:06,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89054851] [2020-07-29 03:15:06,318 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:15:06,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:06,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:15:06,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:15:06,340 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 5 states. [2020-07-29 03:15:08,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:08,133 INFO L93 Difference]: Finished difference Result 295 states and 521 transitions. [2020-07-29 03:15:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:15:08,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:15:08,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:08,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 295 states and 521 transitions. [2020-07-29 03:15:08,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2020-07-29 03:15:08,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 295 states to 286 states and 504 transitions. [2020-07-29 03:15:08,214 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 286 [2020-07-29 03:15:08,215 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 286 [2020-07-29 03:15:08,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 504 transitions. [2020-07-29 03:15:08,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:08,218 INFO L688 BuchiCegarLoop]: Abstraction has 286 states and 504 transitions. [2020-07-29 03:15:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 504 transitions. [2020-07-29 03:15:08,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2020-07-29 03:15:08,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:15:08,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 286 states and 504 transitions. Second operand 286 states. [2020-07-29 03:15:08,267 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states and 504 transitions. Second operand 286 states. [2020-07-29 03:15:08,269 INFO L87 Difference]: Start difference. First operand 286 states and 504 transitions. Second operand 286 states. [2020-07-29 03:15:08,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:08,287 INFO L93 Difference]: Finished difference Result 286 states and 504 transitions. [2020-07-29 03:15:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 504 transitions. [2020-07-29 03:15:08,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:08,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:08,292 INFO L74 IsIncluded]: Start isIncluded. First operand 286 states. Second operand 286 states and 504 transitions. [2020-07-29 03:15:08,292 INFO L87 Difference]: Start difference. First operand 286 states. Second operand 286 states and 504 transitions. [2020-07-29 03:15:08,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:08,306 INFO L93 Difference]: Finished difference Result 286 states and 504 transitions. [2020-07-29 03:15:08,307 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 504 transitions. [2020-07-29 03:15:08,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:08,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:08,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:15:08,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:15:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2020-07-29 03:15:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 504 transitions. [2020-07-29 03:15:08,325 INFO L711 BuchiCegarLoop]: Abstraction has 286 states and 504 transitions. [2020-07-29 03:15:08,325 INFO L591 BuchiCegarLoop]: Abstraction has 286 states and 504 transitions. [2020-07-29 03:15:08,325 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:15:08,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 504 transitions. [2020-07-29 03:15:08,328 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2020-07-29 03:15:08,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:08,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:08,331 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:15:08,332 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:15:08,332 INFO L794 eck$LassoCheckResult]: Stem: 804#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; 632#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 633#L439 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 662#L450 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 663#L460 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 658#L471 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 882#L481 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 871#L492 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 869#L502 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 799#L513 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 796#L523 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 630#L534 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 627#L544 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 625#L555 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 626#L565 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 624#L576 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 730#L586 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 726#L597 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 858#L607 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 784#L618 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 857#L628 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 610#L639 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 760#L649 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 678#L660 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 674#L670 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 672#L681 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 673#L691 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 693#L702 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 886#L712 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 755#L723 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 874#L733 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 807#L744 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 805#L754 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 651#L765 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 648#L775 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 644#L786 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 645#L796 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 643#L807 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 740#L817 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 739#L828 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 864#L838 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 777#L849 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 774#L859 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 670#L870 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 772#L880 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 710#L891 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 707#L901 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 705#L912 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 706#L922 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 704#L933 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 851#L943 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 660#L943-1 init_#res := init_~tmp___23~0; 835#L1064 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; 810#L66 assume !(0 == assume_abort_if_not_~cond); 646#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 647#L1201-2 [2020-07-29 03:15:08,333 INFO L796 eck$LassoCheckResult]: Loop: 647#L1201-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 782#L154 assume !(0 != ~mode1~0 % 256); 606#L186 assume !(~r1~0 < 3); 608#L186-1 ~mode1~0 := 1; 653#L154-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 712#L207 assume !(0 != ~mode2~0 % 256); 714#L239 assume !(~r2~0 < 3); 830#L239-1 ~mode2~0 := 1; 615#L207-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 745#L260 assume !(0 != ~mode3~0 % 256); 780#L292 assume !(~r3~0 < 3); 621#L292-1 ~mode3~0 := 1; 775#L260-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 821#L313 assume !(0 != ~mode4~0 % 256); 684#L345 assume !(~r4~0 < 3); 685#L345-1 ~mode4~0 := 1; 687#L313-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 679#L1072 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 680#L1073 assume ~st1~0 + ~nl1~0 <= 1; 820#L1074 assume ~st2~0 + ~nl2~0 <= 1; 840#L1075 assume ~st3~0 + ~nl3~0 <= 1; 841#L1076 assume ~st4~0 + ~nl4~0 <= 1; 727#L1077 assume ~r1~0 >= 3; 728#L1081 assume ~r1~0 < 3; 842#L1086 assume ~r1~0 >= 3; 793#L1091 assume ~r1~0 < 3;check_~tmp~1 := 1; 681#L1072-1 check_#res := check_~tmp~1; 682#L1124 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 809#L1244 assume !(0 == assert_~arg % 256); 753#L1239 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 647#L1201-2 [2020-07-29 03:15:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1972521662, now seen corresponding path program 2 times [2020-07-29 03:15:08,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:08,334 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316371006] [2020-07-29 03:15:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:08,522 INFO L280 TraceCheckUtils]: 0: Hoare triple {1465#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; {1465#true} is VALID [2020-07-29 03:15:08,523 INFO L280 TraceCheckUtils]: 1: Hoare triple {1465#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {1465#true} is VALID [2020-07-29 03:15:08,523 INFO L280 TraceCheckUtils]: 2: Hoare triple {1465#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,524 INFO L280 TraceCheckUtils]: 3: Hoare triple {1465#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {1465#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,524 INFO L280 TraceCheckUtils]: 5: Hoare triple {1465#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,524 INFO L280 TraceCheckUtils]: 6: Hoare triple {1465#true} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,525 INFO L280 TraceCheckUtils]: 7: Hoare triple {1465#true} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,525 INFO L280 TraceCheckUtils]: 8: Hoare triple {1465#true} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,525 INFO L280 TraceCheckUtils]: 9: Hoare triple {1465#true} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,525 INFO L280 TraceCheckUtils]: 10: Hoare triple {1465#true} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,526 INFO L280 TraceCheckUtils]: 11: Hoare triple {1465#true} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,526 INFO L280 TraceCheckUtils]: 12: Hoare triple {1465#true} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,526 INFO L280 TraceCheckUtils]: 13: Hoare triple {1465#true} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,527 INFO L280 TraceCheckUtils]: 14: Hoare triple {1465#true} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,527 INFO L280 TraceCheckUtils]: 15: Hoare triple {1465#true} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,527 INFO L280 TraceCheckUtils]: 16: Hoare triple {1465#true} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,528 INFO L280 TraceCheckUtils]: 17: Hoare triple {1465#true} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,528 INFO L280 TraceCheckUtils]: 18: Hoare triple {1465#true} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,528 INFO L280 TraceCheckUtils]: 19: Hoare triple {1465#true} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {1465#true} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,529 INFO L280 TraceCheckUtils]: 21: Hoare triple {1465#true} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,529 INFO L280 TraceCheckUtils]: 22: Hoare triple {1465#true} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,530 INFO L280 TraceCheckUtils]: 23: Hoare triple {1465#true} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,530 INFO L280 TraceCheckUtils]: 24: Hoare triple {1465#true} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,530 INFO L280 TraceCheckUtils]: 25: Hoare triple {1465#true} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,531 INFO L280 TraceCheckUtils]: 26: Hoare triple {1465#true} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,531 INFO L280 TraceCheckUtils]: 27: Hoare triple {1465#true} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,531 INFO L280 TraceCheckUtils]: 28: Hoare triple {1465#true} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,532 INFO L280 TraceCheckUtils]: 29: Hoare triple {1465#true} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,532 INFO L280 TraceCheckUtils]: 30: Hoare triple {1465#true} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,532 INFO L280 TraceCheckUtils]: 31: Hoare triple {1465#true} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,533 INFO L280 TraceCheckUtils]: 32: Hoare triple {1465#true} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,533 INFO L280 TraceCheckUtils]: 33: Hoare triple {1465#true} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,533 INFO L280 TraceCheckUtils]: 34: Hoare triple {1465#true} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,534 INFO L280 TraceCheckUtils]: 35: Hoare triple {1465#true} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,534 INFO L280 TraceCheckUtils]: 36: Hoare triple {1465#true} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,534 INFO L280 TraceCheckUtils]: 37: Hoare triple {1465#true} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,535 INFO L280 TraceCheckUtils]: 38: Hoare triple {1465#true} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,535 INFO L280 TraceCheckUtils]: 39: Hoare triple {1465#true} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,535 INFO L280 TraceCheckUtils]: 40: Hoare triple {1465#true} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,536 INFO L280 TraceCheckUtils]: 41: Hoare triple {1465#true} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,536 INFO L280 TraceCheckUtils]: 42: Hoare triple {1465#true} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,536 INFO L280 TraceCheckUtils]: 43: Hoare triple {1465#true} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,537 INFO L280 TraceCheckUtils]: 44: Hoare triple {1465#true} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,537 INFO L280 TraceCheckUtils]: 45: Hoare triple {1465#true} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,537 INFO L280 TraceCheckUtils]: 46: Hoare triple {1465#true} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,538 INFO L280 TraceCheckUtils]: 47: Hoare triple {1465#true} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,538 INFO L280 TraceCheckUtils]: 48: Hoare triple {1465#true} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {1465#true} is VALID [2020-07-29 03:15:08,538 INFO L280 TraceCheckUtils]: 49: Hoare triple {1465#true} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {1465#true} is VALID [2020-07-29 03:15:08,539 INFO L280 TraceCheckUtils]: 50: Hoare triple {1465#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {1467#(= 0 ULTIMATE.start_init_~tmp___23~0)} is VALID [2020-07-29 03:15:08,540 INFO L280 TraceCheckUtils]: 51: Hoare triple {1467#(= 0 ULTIMATE.start_init_~tmp___23~0)} init_#res := init_~tmp___23~0; {1468#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:15:08,541 INFO L280 TraceCheckUtils]: 52: Hoare triple {1468#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; {1469#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:15:08,542 INFO L280 TraceCheckUtils]: 53: Hoare triple {1469#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {1466#false} is VALID [2020-07-29 03:15:08,542 INFO L280 TraceCheckUtils]: 54: Hoare triple {1466#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {1466#false} is VALID [2020-07-29 03:15:08,545 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:15:08,546 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316371006] [2020-07-29 03:15:08,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:08,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:08,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506748417] [2020-07-29 03:15:08,547 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:15:08,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:08,548 INFO L82 PathProgramCache]: Analyzing trace with hash 970511552, now seen corresponding path program 1 times [2020-07-29 03:15:08,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:08,548 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353477259] [2020-07-29 03:15:08,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:08,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {1470#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; {1470#true} is VALID [2020-07-29 03:15:08,587 INFO L280 TraceCheckUtils]: 1: Hoare triple {1470#true} assume !(0 != ~mode1~0 % 256); {1470#true} is VALID [2020-07-29 03:15:08,588 INFO L280 TraceCheckUtils]: 2: Hoare triple {1470#true} assume !(~r1~0 < 3); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {1472#(< 2 ~r1~0)} ~mode1~0 := 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,590 INFO L280 TraceCheckUtils]: 4: Hoare triple {1472#(< 2 ~r1~0)} havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,591 INFO L280 TraceCheckUtils]: 5: Hoare triple {1472#(< 2 ~r1~0)} assume !(0 != ~mode2~0 % 256); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {1472#(< 2 ~r1~0)} assume !(~r2~0 < 3); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,592 INFO L280 TraceCheckUtils]: 7: Hoare triple {1472#(< 2 ~r1~0)} ~mode2~0 := 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,593 INFO L280 TraceCheckUtils]: 8: Hoare triple {1472#(< 2 ~r1~0)} havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,593 INFO L280 TraceCheckUtils]: 9: Hoare triple {1472#(< 2 ~r1~0)} assume !(0 != ~mode3~0 % 256); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,594 INFO L280 TraceCheckUtils]: 10: Hoare triple {1472#(< 2 ~r1~0)} assume !(~r3~0 < 3); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {1472#(< 2 ~r1~0)} ~mode3~0 := 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,596 INFO L280 TraceCheckUtils]: 12: Hoare triple {1472#(< 2 ~r1~0)} havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {1472#(< 2 ~r1~0)} assume !(0 != ~mode4~0 % 256); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,597 INFO L280 TraceCheckUtils]: 14: Hoare triple {1472#(< 2 ~r1~0)} assume !(~r4~0 < 3); {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,598 INFO L280 TraceCheckUtils]: 15: Hoare triple {1472#(< 2 ~r1~0)} ~mode4~0 := 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,599 INFO L280 TraceCheckUtils]: 16: Hoare triple {1472#(< 2 ~r1~0)} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,599 INFO L280 TraceCheckUtils]: 17: Hoare triple {1472#(< 2 ~r1~0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,600 INFO L280 TraceCheckUtils]: 18: Hoare triple {1472#(< 2 ~r1~0)} assume ~st1~0 + ~nl1~0 <= 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,601 INFO L280 TraceCheckUtils]: 19: Hoare triple {1472#(< 2 ~r1~0)} assume ~st2~0 + ~nl2~0 <= 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,601 INFO L280 TraceCheckUtils]: 20: Hoare triple {1472#(< 2 ~r1~0)} assume ~st3~0 + ~nl3~0 <= 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,602 INFO L280 TraceCheckUtils]: 21: Hoare triple {1472#(< 2 ~r1~0)} assume ~st4~0 + ~nl4~0 <= 1; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,603 INFO L280 TraceCheckUtils]: 22: Hoare triple {1472#(< 2 ~r1~0)} assume ~r1~0 >= 3; {1472#(< 2 ~r1~0)} is VALID [2020-07-29 03:15:08,604 INFO L280 TraceCheckUtils]: 23: Hoare triple {1472#(< 2 ~r1~0)} assume ~r1~0 < 3; {1471#false} is VALID [2020-07-29 03:15:08,604 INFO L280 TraceCheckUtils]: 24: Hoare triple {1471#false} assume ~r1~0 >= 3; {1471#false} is VALID [2020-07-29 03:15:08,604 INFO L280 TraceCheckUtils]: 25: Hoare triple {1471#false} assume ~r1~0 < 3;check_~tmp~1 := 1; {1471#false} is VALID [2020-07-29 03:15:08,605 INFO L280 TraceCheckUtils]: 26: Hoare triple {1471#false} check_#res := check_~tmp~1; {1471#false} is VALID [2020-07-29 03:15:08,605 INFO L280 TraceCheckUtils]: 27: Hoare triple {1471#false} main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1471#false} is VALID [2020-07-29 03:15:08,605 INFO L280 TraceCheckUtils]: 28: Hoare triple {1471#false} assume !(0 == assert_~arg % 256); {1471#false} is VALID [2020-07-29 03:15:08,606 INFO L280 TraceCheckUtils]: 29: Hoare triple {1471#false} main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; {1471#false} is VALID [2020-07-29 03:15:08,607 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:15:08,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353477259] [2020-07-29 03:15:08,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:08,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:15:08,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748244481] [2020-07-29 03:15:08,609 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:15:08,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:08,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:15:08,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:15:08,609 INFO L87 Difference]: Start difference. First operand 286 states and 504 transitions. cyclomatic complexity: 219 Second operand 3 states. [2020-07-29 03:15:09,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:09,317 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2020-07-29 03:15:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:15:09,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:15:09,356 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:15:09,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 371 states and 638 transitions. [2020-07-29 03:15:09,376 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2020-07-29 03:15:09,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 371 states to 371 states and 638 transitions. [2020-07-29 03:15:09,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 371 [2020-07-29 03:15:09,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 371 [2020-07-29 03:15:09,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 371 states and 638 transitions. [2020-07-29 03:15:09,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:09,404 INFO L688 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2020-07-29 03:15:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states and 638 transitions. [2020-07-29 03:15:09,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2020-07-29 03:15:09,423 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:15:09,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states and 638 transitions. Second operand 371 states. [2020-07-29 03:15:09,423 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states and 638 transitions. Second operand 371 states. [2020-07-29 03:15:09,423 INFO L87 Difference]: Start difference. First operand 371 states and 638 transitions. Second operand 371 states. [2020-07-29 03:15:09,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:09,440 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2020-07-29 03:15:09,440 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 638 transitions. [2020-07-29 03:15:09,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:09,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:09,442 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand 371 states and 638 transitions. [2020-07-29 03:15:09,442 INFO L87 Difference]: Start difference. First operand 371 states. Second operand 371 states and 638 transitions. [2020-07-29 03:15:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:09,459 INFO L93 Difference]: Finished difference Result 371 states and 638 transitions. [2020-07-29 03:15:09,459 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 638 transitions. [2020-07-29 03:15:09,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:15:09,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:15:09,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:15:09,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:15:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-07-29 03:15:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 638 transitions. [2020-07-29 03:15:09,478 INFO L711 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2020-07-29 03:15:09,478 INFO L591 BuchiCegarLoop]: Abstraction has 371 states and 638 transitions. [2020-07-29 03:15:09,478 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:15:09,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 638 transitions. [2020-07-29 03:15:09,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2020-07-29 03:15:09,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:09,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:09,483 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, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:15:09,484 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, 1, 1, 1, 1] [2020-07-29 03:15:09,487 INFO L794 eck$LassoCheckResult]: Stem: 2044#ULTIMATE.startENTRY ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; 1871#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; 1872#L439 assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; 1901#L450 init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); 1902#L460 assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; 1897#L471 init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); 2127#L481 assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; 2116#L492 init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); 2114#L502 assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; 2039#L513 init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); 2036#L523 assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; 1869#L534 init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); 1866#L544 assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; 1864#L555 init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); 1865#L565 assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; 1863#L576 init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); 1968#L586 assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; 1965#L597 init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); 2099#L607 assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; 2024#L618 init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); 2098#L628 assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; 1851#L639 init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); 1999#L649 assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; 1917#L660 init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); 1913#L670 assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; 1911#L681 init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); 1912#L691 assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; 1932#L702 init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); 2131#L712 assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; 1994#L723 init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); 2119#L733 assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; 2047#L744 init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); 2045#L754 assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; 1890#L765 init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); 1887#L775 assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; 1883#L786 init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); 1884#L796 assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; 1882#L807 init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); 1978#L817 assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; 1977#L828 init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); 2106#L838 assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; 2015#L849 init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); 2012#L859 assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; 1909#L870 init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); 2011#L880 assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; 1949#L891 init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); 1946#L901 assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; 1944#L912 init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); 1945#L922 assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; 1943#L933 init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); 2092#L943 assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; 1899#L943-1 init_#res := init_~tmp___23~0; 2075#L1064 main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; 2049#L66 assume !(0 == assume_abort_if_not_~cond); 1885#L65 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; 1886#L1201-2 [2020-07-29 03:15:09,488 INFO L796 eck$LassoCheckResult]: Loop: 1886#L1201-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; 2145#L154 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256); 2022#L156 assume !(0 != ~ep21~0 % 256); 2066#L156-1 assume !(0 != ~ep31~0 % 256); 1984#L163 assume !(0 != ~ep41~0 % 256); 1986#L170 assume !(3 == ~r1~0); 2068#L177 ~mode1~0 := 0; 2199#L154-2 havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; 2197#L207 assume !(0 != ~mode2~0 % 256); 2198#L239 assume !(~r2~0 < 3); 2186#L239-1 ~mode2~0 := 1; 2185#L207-2 havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; 2181#L260 assume !(0 != ~mode3~0 % 256); 2177#L292 assume !(~r3~0 < 3); 2170#L292-1 ~mode3~0 := 1; 2169#L260-2 havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; 2168#L313 assume !(0 != ~mode4~0 % 256); 2151#L345 assume !(~r4~0 < 3); 2143#L345-1 ~mode4~0 := 1; 2141#L313-2 ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 2140#L1072 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2139#L1073 assume ~st1~0 + ~nl1~0 <= 1; 2138#L1074 assume ~st2~0 + ~nl2~0 <= 1; 2137#L1075 assume ~st3~0 + ~nl3~0 <= 1; 2136#L1076 assume ~st4~0 + ~nl4~0 <= 1; 2135#L1077 assume !(~r1~0 >= 3); 2111#L1080 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2112#L1081 assume ~r1~0 < 3; 2214#L1086 assume !(~r1~0 >= 3); 2032#L1090 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2033#L1091 assume ~r1~0 < 3;check_~tmp~1 := 1; 2163#L1072-1 check_#res := check_~tmp~1; 2160#L1124 main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 2156#L1244 assume !(0 == assert_~arg % 256); 2150#L1239 main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; 1886#L1201-2 [2020-07-29 03:15:09,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1972521662, now seen corresponding path program 3 times [2020-07-29 03:15:09,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:09,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447019608] [2020-07-29 03:15:09,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:09,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {2960#true} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; {2960#true} is VALID [2020-07-29 03:15:09,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {2960#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {2960#true} is VALID [2020-07-29 03:15:09,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {2960#true} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,657 INFO L280 TraceCheckUtils]: 3: Hoare triple {2960#true} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {2960#true} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,658 INFO L280 TraceCheckUtils]: 5: Hoare triple {2960#true} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,658 INFO L280 TraceCheckUtils]: 6: Hoare triple {2960#true} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,659 INFO L280 TraceCheckUtils]: 7: Hoare triple {2960#true} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,659 INFO L280 TraceCheckUtils]: 8: Hoare triple {2960#true} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,659 INFO L280 TraceCheckUtils]: 9: Hoare triple {2960#true} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,659 INFO L280 TraceCheckUtils]: 10: Hoare triple {2960#true} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {2960#true} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,660 INFO L280 TraceCheckUtils]: 12: Hoare triple {2960#true} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {2960#true} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {2960#true} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,661 INFO L280 TraceCheckUtils]: 15: Hoare triple {2960#true} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,661 INFO L280 TraceCheckUtils]: 16: Hoare triple {2960#true} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,662 INFO L280 TraceCheckUtils]: 17: Hoare triple {2960#true} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,662 INFO L280 TraceCheckUtils]: 18: Hoare triple {2960#true} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,662 INFO L280 TraceCheckUtils]: 19: Hoare triple {2960#true} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,663 INFO L280 TraceCheckUtils]: 20: Hoare triple {2960#true} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,663 INFO L280 TraceCheckUtils]: 21: Hoare triple {2960#true} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,664 INFO L280 TraceCheckUtils]: 22: Hoare triple {2960#true} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,664 INFO L280 TraceCheckUtils]: 23: Hoare triple {2960#true} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,665 INFO L280 TraceCheckUtils]: 24: Hoare triple {2960#true} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,665 INFO L280 TraceCheckUtils]: 25: Hoare triple {2960#true} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,665 INFO L280 TraceCheckUtils]: 26: Hoare triple {2960#true} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,666 INFO L280 TraceCheckUtils]: 27: Hoare triple {2960#true} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,666 INFO L280 TraceCheckUtils]: 28: Hoare triple {2960#true} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,666 INFO L280 TraceCheckUtils]: 29: Hoare triple {2960#true} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,667 INFO L280 TraceCheckUtils]: 30: Hoare triple {2960#true} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,667 INFO L280 TraceCheckUtils]: 31: Hoare triple {2960#true} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,668 INFO L280 TraceCheckUtils]: 32: Hoare triple {2960#true} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,668 INFO L280 TraceCheckUtils]: 33: Hoare triple {2960#true} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,668 INFO L280 TraceCheckUtils]: 34: Hoare triple {2960#true} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,669 INFO L280 TraceCheckUtils]: 35: Hoare triple {2960#true} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,669 INFO L280 TraceCheckUtils]: 36: Hoare triple {2960#true} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,669 INFO L280 TraceCheckUtils]: 37: Hoare triple {2960#true} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,670 INFO L280 TraceCheckUtils]: 38: Hoare triple {2960#true} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,670 INFO L280 TraceCheckUtils]: 39: Hoare triple {2960#true} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,671 INFO L280 TraceCheckUtils]: 40: Hoare triple {2960#true} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,671 INFO L280 TraceCheckUtils]: 41: Hoare triple {2960#true} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,671 INFO L280 TraceCheckUtils]: 42: Hoare triple {2960#true} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,672 INFO L280 TraceCheckUtils]: 43: Hoare triple {2960#true} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,672 INFO L280 TraceCheckUtils]: 44: Hoare triple {2960#true} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,672 INFO L280 TraceCheckUtils]: 45: Hoare triple {2960#true} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,673 INFO L280 TraceCheckUtils]: 46: Hoare triple {2960#true} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,673 INFO L280 TraceCheckUtils]: 47: Hoare triple {2960#true} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,673 INFO L280 TraceCheckUtils]: 48: Hoare triple {2960#true} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {2960#true} is VALID [2020-07-29 03:15:09,674 INFO L280 TraceCheckUtils]: 49: Hoare triple {2960#true} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {2960#true} is VALID [2020-07-29 03:15:09,675 INFO L280 TraceCheckUtils]: 50: Hoare triple {2960#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {2962#(= 0 ULTIMATE.start_init_~tmp___23~0)} is VALID [2020-07-29 03:15:09,676 INFO L280 TraceCheckUtils]: 51: Hoare triple {2962#(= 0 ULTIMATE.start_init_~tmp___23~0)} init_#res := init_~tmp___23~0; {2963#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:15:09,677 INFO L280 TraceCheckUtils]: 52: Hoare triple {2963#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; {2964#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:15:09,678 INFO L280 TraceCheckUtils]: 53: Hoare triple {2964#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {2961#false} is VALID [2020-07-29 03:15:09,678 INFO L280 TraceCheckUtils]: 54: Hoare triple {2961#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {2961#false} is VALID [2020-07-29 03:15:09,683 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:15:09,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447019608] [2020-07-29 03:15:09,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:15:09,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:15:09,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557265220] [2020-07-29 03:15:09,685 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:15:09,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:09,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1089822456, now seen corresponding path program 1 times [2020-07-29 03:15:09,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:15:09,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067718360] [2020-07-29 03:15:09,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:15:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:15:09,709 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:15:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:15:09,732 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:15:09,785 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:15:10,386 WARN L193 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 154 [2020-07-29 03:15:10,926 WARN L193 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 155 [2020-07-29 03:15:10,944 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:15:10,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:15:10,945 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:15:10,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:15:10,946 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:15:10,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:10,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:15:10,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:15:10,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2020-07-29 03:15:10,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:15:10,947 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:15:11,041 INFO L141 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:15:11,057 INFO L141 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:15:11,062 INFO L141 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:15:11,068 INFO L141 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:15:11,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,075 INFO L141 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:15:11,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,083 INFO L141 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:15:11,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,093 INFO L141 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:15:11,097 INFO L141 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:15:11,102 INFO L141 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:15:11,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,111 INFO L141 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:15:11,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,127 INFO L141 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:15:11,130 INFO L141 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:15:11,134 INFO L141 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:15:11,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,154 INFO L141 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:15:11,161 INFO L141 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:15:11,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,174 INFO L141 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:15:11,179 INFO L141 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:15:11,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,218 INFO L141 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:15:11,221 INFO L141 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:15:11,283 INFO L141 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:15:11,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:11,310 INFO L141 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:15:11,314 INFO L141 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:15:11,319 INFO L141 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:15:12,206 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:12,891 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:13,075 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:15:13,076 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:15:13,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:15:13,084 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:15:13,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:15:13,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:15:13,284 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:15:13,286 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:15:13,287 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:15:13,287 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:15:13,287 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:15:13,287 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:15:13,287 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:13,287 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:15:13,287 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:15:13,287 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2020-07-29 03:15:13,287 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:15:13,287 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:15:13,351 INFO L141 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:15:13,361 INFO L141 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:15:13,367 INFO L141 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:15:13,369 INFO L141 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:15:13,372 INFO L141 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:15:13,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,390 INFO L141 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:15:13,395 INFO L141 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:15:13,401 INFO L141 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:15:13,405 INFO L141 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:15:13,411 INFO L141 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:15:13,414 INFO L141 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:15:13,417 INFO L141 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:15:13,426 INFO L141 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:15:13,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,482 INFO L141 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:15:13,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,494 INFO L141 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:15:13,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,511 INFO L141 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:15:13,519 INFO L141 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:15:13,528 INFO L141 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:15:13,532 INFO L141 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:15:13,540 INFO L141 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:15:13,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,565 INFO L141 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:15:13,585 INFO L141 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:15:13,595 INFO L141 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:15:13,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:15:13,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,609 INFO L141 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:15:13,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:15:13,623 INFO L141 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:15:13,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:15:13,634 INFO L141 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:15:14,294 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:14,845 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-07-29 03:15:15,187 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:15:15,192 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:15:15,197 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:15:15,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,207 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:15:15,230 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:15:15,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:15,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:15,238 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:15:15,268 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:15:15,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,271 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:15:15,297 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:15:15,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,301 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:15:15,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:15:15,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,329 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:15:15,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:15,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,356 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,364 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:15:15,397 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:15:15,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,398 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,399 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,399 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,401 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:15:15,455 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:15:15,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:15,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:15,463 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:15:15,490 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:15:15,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,496 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:15:15,519 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:15:15,521 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,523 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:15,523 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:15,527 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,551 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:15:15,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,556 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:15:15,580 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:15:15,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,584 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:15:15,609 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:15:15,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,612 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:15,612 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:15:15,615 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:15:15,639 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:15:15,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,641 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,641 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,641 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,643 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:15:15,667 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:15:15,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,679 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,679 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,689 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:15:15,725 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:15:15,727 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,728 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,728 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,753 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:15:15,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,755 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,755 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,756 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:15:15,783 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:15:15,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,785 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,785 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:15,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:15:15,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,815 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,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:15:15,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,841 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:15,865 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:15:15,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,869 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:15:15,869 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,873 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:15,897 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,901 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:15,924 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:15:15,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:15:15,925 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:15:15,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:15:15,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:15:15,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:15:15,926 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:15:15,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:15:15,928 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:15:15,938 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:15:15,938 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:15:15,943 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:15:15,943 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:15:15,944 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:15:15,945 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:15:16,012 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:15:16,021 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);" "assume !(0 != ~ep21~0 % 256);" "assume !(0 != ~ep31~0 % 256);" "assume !(0 != ~ep41~0 % 256);" "assume !(3 == ~r1~0);" "~mode1~0 := 0;" "havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;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~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54;" [2020-07-29 03:15:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:15:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:16,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:15:16,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:16,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:15:16,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {2967#unseeded} ~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~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]; {2967#unseeded} is VALID [2020-07-29 03:15:16,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {2967#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~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~ret52, main_#t~ret53, main_#t~post54, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~ep12~0 := main_#t~nondet12;havoc main_#t~nondet12;~ep13~0 := main_#t~nondet13;havoc main_#t~nondet13;~ep14~0 := main_#t~nondet14;havoc main_#t~nondet14;~ep21~0 := main_#t~nondet15;havoc main_#t~nondet15;~ep23~0 := main_#t~nondet16;havoc main_#t~nondet16;~ep24~0 := main_#t~nondet17;havoc main_#t~nondet17;~ep31~0 := main_#t~nondet18;havoc main_#t~nondet18;~ep32~0 := main_#t~nondet19;havoc main_#t~nondet19;~ep34~0 := main_#t~nondet20;havoc main_#t~nondet20;~ep41~0 := main_#t~nondet21;havoc main_#t~nondet21;~ep42~0 := main_#t~nondet22;havoc main_#t~nondet22;~ep43~0 := main_#t~nondet23;havoc main_#t~nondet23;~id1~0 := main_#t~nondet24;havoc main_#t~nondet24;~r1~0 := main_#t~nondet25;havoc main_#t~nondet25;~st1~0 := main_#t~nondet26;havoc main_#t~nondet26;~nl1~0 := main_#t~nondet27;havoc main_#t~nondet27;~m1~0 := main_#t~nondet28;havoc main_#t~nondet28;~max1~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode1~0 := main_#t~nondet30;havoc main_#t~nondet30;~id2~0 := main_#t~nondet31;havoc main_#t~nondet31;~r2~0 := main_#t~nondet32;havoc main_#t~nondet32;~st2~0 := main_#t~nondet33;havoc main_#t~nondet33;~nl2~0 := main_#t~nondet34;havoc main_#t~nondet34;~m2~0 := main_#t~nondet35;havoc main_#t~nondet35;~max2~0 := main_#t~nondet36;havoc main_#t~nondet36;~mode2~0 := main_#t~nondet37;havoc main_#t~nondet37;~id3~0 := main_#t~nondet38;havoc main_#t~nondet38;~r3~0 := main_#t~nondet39;havoc main_#t~nondet39;~st3~0 := main_#t~nondet40;havoc main_#t~nondet40;~nl3~0 := main_#t~nondet41;havoc main_#t~nondet41;~m3~0 := main_#t~nondet42;havoc main_#t~nondet42;~max3~0 := main_#t~nondet43;havoc main_#t~nondet43;~mode3~0 := main_#t~nondet44;havoc main_#t~nondet44;~id4~0 := main_#t~nondet45;havoc main_#t~nondet45;~r4~0 := main_#t~nondet46;havoc main_#t~nondet46;~st4~0 := main_#t~nondet47;havoc main_#t~nondet47;~nl4~0 := main_#t~nondet48;havoc main_#t~nondet48;~m4~0 := main_#t~nondet49;havoc main_#t~nondet49;~max4~0 := main_#t~nondet50;havoc main_#t~nondet50;~mode4~0 := main_#t~nondet51;havoc main_#t~nondet51;havoc init_#res;havoc init_~r121~0, init_~r131~0, init_~r141~0, init_~r211~0, init_~r231~0, init_~r241~0, init_~r311~0, init_~r321~0, init_~r341~0, init_~r411~0, init_~r421~0, init_~r431~0, init_~r122~0, init_~tmp~0, init_~r132~0, init_~tmp___0~0, init_~r142~0, init_~tmp___1~0, init_~r212~0, init_~tmp___2~0, init_~r232~0, init_~tmp___3~0, init_~r242~0, init_~tmp___4~0, init_~r312~0, init_~tmp___5~0, init_~r322~0, init_~tmp___6~0, init_~r342~0, init_~tmp___7~0, init_~r412~0, init_~tmp___8~0, init_~r422~0, init_~tmp___9~0, init_~r432~0, init_~tmp___10~0, init_~r123~0, init_~tmp___11~0, init_~r133~0, init_~tmp___12~0, init_~r143~0, init_~tmp___13~0, init_~r213~0, init_~tmp___14~0, init_~r233~0, init_~tmp___15~0, init_~r243~0, init_~tmp___16~0, init_~r313~0, init_~tmp___17~0, init_~r323~0, init_~tmp___18~0, init_~r343~0, init_~tmp___19~0, init_~r413~0, init_~tmp___20~0, init_~r423~0, init_~tmp___21~0, init_~r433~0, init_~tmp___22~0, init_~tmp___23~0;havoc init_~r121~0;havoc init_~r131~0;havoc init_~r141~0;havoc init_~r211~0;havoc init_~r231~0;havoc init_~r241~0;havoc init_~r311~0;havoc init_~r321~0;havoc init_~r341~0;havoc init_~r411~0;havoc init_~r421~0;havoc init_~r431~0;havoc init_~r122~0;havoc init_~tmp~0;havoc init_~r132~0;havoc init_~tmp___0~0;havoc init_~r142~0;havoc init_~tmp___1~0;havoc init_~r212~0;havoc init_~tmp___2~0;havoc init_~r232~0;havoc init_~tmp___3~0;havoc init_~r242~0;havoc init_~tmp___4~0;havoc init_~r312~0;havoc init_~tmp___5~0;havoc init_~r322~0;havoc init_~tmp___6~0;havoc init_~r342~0;havoc init_~tmp___7~0;havoc init_~r412~0;havoc init_~tmp___8~0;havoc init_~r422~0;havoc init_~tmp___9~0;havoc init_~r432~0;havoc init_~tmp___10~0;havoc init_~r123~0;havoc init_~tmp___11~0;havoc init_~r133~0;havoc init_~tmp___12~0;havoc init_~r143~0;havoc init_~tmp___13~0;havoc init_~r213~0;havoc init_~tmp___14~0;havoc init_~r233~0;havoc init_~tmp___15~0;havoc init_~r243~0;havoc init_~tmp___16~0;havoc init_~r313~0;havoc init_~tmp___17~0;havoc init_~r323~0;havoc init_~tmp___18~0;havoc init_~r343~0;havoc init_~tmp___19~0;havoc init_~r413~0;havoc init_~tmp___20~0;havoc init_~r423~0;havoc init_~tmp___21~0;havoc init_~r433~0;havoc init_~tmp___22~0;havoc init_~tmp___23~0;init_~r121~0 := ~ep12~0;init_~r131~0 := ~ep13~0;init_~r141~0 := ~ep14~0;init_~r211~0 := ~ep21~0;init_~r231~0 := ~ep23~0;init_~r241~0 := ~ep24~0;init_~r311~0 := ~ep31~0;init_~r321~0 := ~ep32~0;init_~r341~0 := ~ep34~0;init_~r411~0 := ~ep41~0;init_~r421~0 := ~ep42~0;init_~r431~0 := ~ep43~0; {2967#unseeded} is VALID [2020-07-29 03:15:16,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {2967#unseeded} assume 0 != init_~r121~0 % 256;init_~tmp~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,330 INFO L280 TraceCheckUtils]: 3: Hoare triple {2967#unseeded} init_~r122~0 := (if 0 == init_~tmp~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {2967#unseeded} assume 0 != init_~r131~0 % 256;init_~tmp___0~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,331 INFO L280 TraceCheckUtils]: 5: Hoare triple {2967#unseeded} init_~r132~0 := (if 0 == init_~tmp___0~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,332 INFO L280 TraceCheckUtils]: 6: Hoare triple {2967#unseeded} assume 0 != init_~r141~0 % 256;init_~tmp___1~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,333 INFO L280 TraceCheckUtils]: 7: Hoare triple {2967#unseeded} init_~r142~0 := (if 0 == init_~tmp___1~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,334 INFO L280 TraceCheckUtils]: 8: Hoare triple {2967#unseeded} assume 0 != init_~r211~0 % 256;init_~tmp___2~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,335 INFO L280 TraceCheckUtils]: 9: Hoare triple {2967#unseeded} init_~r212~0 := (if 0 == init_~tmp___2~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,336 INFO L280 TraceCheckUtils]: 10: Hoare triple {2967#unseeded} assume 0 != init_~r231~0 % 256;init_~tmp___3~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,337 INFO L280 TraceCheckUtils]: 11: Hoare triple {2967#unseeded} init_~r232~0 := (if 0 == init_~tmp___3~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,338 INFO L280 TraceCheckUtils]: 12: Hoare triple {2967#unseeded} assume 0 != init_~r241~0 % 256;init_~tmp___4~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,339 INFO L280 TraceCheckUtils]: 13: Hoare triple {2967#unseeded} init_~r242~0 := (if 0 == init_~tmp___4~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,340 INFO L280 TraceCheckUtils]: 14: Hoare triple {2967#unseeded} assume 0 != init_~r311~0 % 256;init_~tmp___5~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,340 INFO L280 TraceCheckUtils]: 15: Hoare triple {2967#unseeded} init_~r312~0 := (if 0 == init_~tmp___5~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,341 INFO L280 TraceCheckUtils]: 16: Hoare triple {2967#unseeded} assume 0 != init_~r321~0 % 256;init_~tmp___6~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,342 INFO L280 TraceCheckUtils]: 17: Hoare triple {2967#unseeded} init_~r322~0 := (if 0 == init_~tmp___6~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,343 INFO L280 TraceCheckUtils]: 18: Hoare triple {2967#unseeded} assume 0 != init_~r341~0 % 256;init_~tmp___7~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,344 INFO L280 TraceCheckUtils]: 19: Hoare triple {2967#unseeded} init_~r342~0 := (if 0 == init_~tmp___7~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,345 INFO L280 TraceCheckUtils]: 20: Hoare triple {2967#unseeded} assume 0 != init_~r411~0 % 256;init_~tmp___8~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,346 INFO L280 TraceCheckUtils]: 21: Hoare triple {2967#unseeded} init_~r412~0 := (if 0 == init_~tmp___8~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,347 INFO L280 TraceCheckUtils]: 22: Hoare triple {2967#unseeded} assume 0 != init_~r421~0 % 256;init_~tmp___9~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,348 INFO L280 TraceCheckUtils]: 23: Hoare triple {2967#unseeded} init_~r422~0 := (if 0 == init_~tmp___9~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,349 INFO L280 TraceCheckUtils]: 24: Hoare triple {2967#unseeded} assume 0 != init_~r431~0 % 256;init_~tmp___10~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,350 INFO L280 TraceCheckUtils]: 25: Hoare triple {2967#unseeded} init_~r432~0 := (if 0 == init_~tmp___10~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,351 INFO L280 TraceCheckUtils]: 26: Hoare triple {2967#unseeded} assume 0 != init_~r122~0 % 256;init_~tmp___11~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,352 INFO L280 TraceCheckUtils]: 27: Hoare triple {2967#unseeded} init_~r123~0 := (if 0 == init_~tmp___11~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,353 INFO L280 TraceCheckUtils]: 28: Hoare triple {2967#unseeded} assume 0 != init_~r132~0 % 256;init_~tmp___12~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,354 INFO L280 TraceCheckUtils]: 29: Hoare triple {2967#unseeded} init_~r133~0 := (if 0 == init_~tmp___12~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,355 INFO L280 TraceCheckUtils]: 30: Hoare triple {2967#unseeded} assume 0 != init_~r142~0 % 256;init_~tmp___13~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,356 INFO L280 TraceCheckUtils]: 31: Hoare triple {2967#unseeded} init_~r143~0 := (if 0 == init_~tmp___13~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,357 INFO L280 TraceCheckUtils]: 32: Hoare triple {2967#unseeded} assume 0 != init_~r212~0 % 256;init_~tmp___14~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,358 INFO L280 TraceCheckUtils]: 33: Hoare triple {2967#unseeded} init_~r213~0 := (if 0 == init_~tmp___14~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,359 INFO L280 TraceCheckUtils]: 34: Hoare triple {2967#unseeded} assume 0 != init_~r232~0 % 256;init_~tmp___15~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,359 INFO L280 TraceCheckUtils]: 35: Hoare triple {2967#unseeded} init_~r233~0 := (if 0 == init_~tmp___15~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,360 INFO L280 TraceCheckUtils]: 36: Hoare triple {2967#unseeded} assume 0 != init_~r242~0 % 256;init_~tmp___16~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,361 INFO L280 TraceCheckUtils]: 37: Hoare triple {2967#unseeded} init_~r243~0 := (if 0 == init_~tmp___16~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,362 INFO L280 TraceCheckUtils]: 38: Hoare triple {2967#unseeded} assume 0 != init_~r312~0 % 256;init_~tmp___17~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,363 INFO L280 TraceCheckUtils]: 39: Hoare triple {2967#unseeded} init_~r313~0 := (if 0 == init_~tmp___17~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,364 INFO L280 TraceCheckUtils]: 40: Hoare triple {2967#unseeded} assume 0 != init_~r322~0 % 256;init_~tmp___18~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,365 INFO L280 TraceCheckUtils]: 41: Hoare triple {2967#unseeded} init_~r323~0 := (if 0 == init_~tmp___18~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,366 INFO L280 TraceCheckUtils]: 42: Hoare triple {2967#unseeded} assume 0 != init_~r342~0 % 256;init_~tmp___19~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,367 INFO L280 TraceCheckUtils]: 43: Hoare triple {2967#unseeded} init_~r343~0 := (if 0 == init_~tmp___19~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,368 INFO L280 TraceCheckUtils]: 44: Hoare triple {2967#unseeded} assume 0 != init_~r412~0 % 256;init_~tmp___20~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,369 INFO L280 TraceCheckUtils]: 45: Hoare triple {2967#unseeded} init_~r413~0 := (if 0 == init_~tmp___20~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,370 INFO L280 TraceCheckUtils]: 46: Hoare triple {2967#unseeded} assume 0 != init_~r422~0 % 256;init_~tmp___21~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,371 INFO L280 TraceCheckUtils]: 47: Hoare triple {2967#unseeded} init_~r423~0 := (if 0 == init_~tmp___21~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,372 INFO L280 TraceCheckUtils]: 48: Hoare triple {2967#unseeded} assume 0 != init_~r432~0 % 256;init_~tmp___22~0 := 1; {2967#unseeded} is VALID [2020-07-29 03:15:16,373 INFO L280 TraceCheckUtils]: 49: Hoare triple {2967#unseeded} init_~r433~0 := (if 0 == init_~tmp___22~0 then 0 else 1); {2967#unseeded} is VALID [2020-07-29 03:15:16,374 INFO L280 TraceCheckUtils]: 50: Hoare triple {2967#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0 := 0; {2967#unseeded} is VALID [2020-07-29 03:15:16,375 INFO L280 TraceCheckUtils]: 51: Hoare triple {2967#unseeded} init_#res := init_~tmp___23~0; {2967#unseeded} is VALID [2020-07-29 03:15:16,375 INFO L280 TraceCheckUtils]: 52: Hoare triple {2967#unseeded} main_#t~ret52 := init_#res;main_~i2~0 := main_#t~ret52;havoc main_#t~ret52;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; {2967#unseeded} is VALID [2020-07-29 03:15:16,376 INFO L280 TraceCheckUtils]: 53: Hoare triple {2967#unseeded} assume !(0 == assume_abort_if_not_~cond); {2967#unseeded} is VALID [2020-07-29 03:15:16,377 INFO L280 TraceCheckUtils]: 54: Hoare triple {2967#unseeded} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0 := 0; {2967#unseeded} is VALID [2020-07-29 03:15:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:16,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:15:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:15:16,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:15:16,495 INFO L280 TraceCheckUtils]: 0: Hoare triple {2970#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15))} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_#t~ite1, node1_#t~ite2; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,496 INFO L280 TraceCheckUtils]: 1: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ 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); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~ep21~0 % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,497 INFO L280 TraceCheckUtils]: 3: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~ep31~0 % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~ep41~0 % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,499 INFO L280 TraceCheckUtils]: 5: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(3 == ~r1~0); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,500 INFO L280 TraceCheckUtils]: 6: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,500 INFO L280 TraceCheckUtils]: 7: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite3, node2_#t~ite4, node2_#t~ite5; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,501 INFO L280 TraceCheckUtils]: 8: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode2~0 % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,502 INFO L280 TraceCheckUtils]: 9: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r2~0 < 3); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite6, node3_#t~ite7, node3_#t~ite8; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode3~0 % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r3~0 < 3); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,507 INFO L280 TraceCheckUtils]: 14: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,508 INFO L280 TraceCheckUtils]: 15: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite9, node4_#t~ite10, node4_#t~ite11; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,508 INFO L280 TraceCheckUtils]: 16: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode4~0 % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,509 INFO L280 TraceCheckUtils]: 17: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r4~0 < 3); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,511 INFO L280 TraceCheckUtils]: 19: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,512 INFO L280 TraceCheckUtils]: 20: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~nl1~0 <= 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,513 INFO L280 TraceCheckUtils]: 22: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st2~0 + ~nl2~0 <= 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,514 INFO L280 TraceCheckUtils]: 23: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st3~0 + ~nl3~0 <= 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,515 INFO L280 TraceCheckUtils]: 24: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st4~0 + ~nl4~0 <= 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,515 INFO L280 TraceCheckUtils]: 25: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 3); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,516 INFO L280 TraceCheckUtils]: 26: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,517 INFO L280 TraceCheckUtils]: 27: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 3; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,518 INFO L280 TraceCheckUtils]: 28: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 3); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,519 INFO L280 TraceCheckUtils]: 29: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,519 INFO L280 TraceCheckUtils]: 30: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 3;check_~tmp~1 := 1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,520 INFO L280 TraceCheckUtils]: 31: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,521 INFO L280 TraceCheckUtils]: 32: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret53 := check_#res;main_~c1~0 := main_#t~ret53;havoc main_#t~ret53;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,522 INFO L280 TraceCheckUtils]: 33: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:15:16,523 INFO L280 TraceCheckUtils]: 34: Hoare triple {3147#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post54 := main_~i2~0;main_~i2~0 := 1 + main_#t~post54;havoc main_#t~post54; {2980#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:15:16,523 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:15:16,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:15:16,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:16,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:16,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:16,574 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:15:16,575 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268 Second operand 3 states. [2020-07-29 03:15:17,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 371 states and 638 transitions. cyclomatic complexity: 268. Second operand 3 states. Result 561 states and 946 transitions. Complement of second has 4 states. [2020-07-29 03:15:17,552 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:15:17,552 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:15:17,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 638 transitions. cyclomatic complexity: 268 [2020-07-29 03:15:17,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:17,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:17,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:15:17,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:15:17,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:15:17,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:15:17,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 946 transitions. [2020-07-29 03:15:17,574 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:17,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:17,578 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 371 states and 638 transitions. cyclomatic complexity: 268 [2020-07-29 03:15:17,759 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 191 examples of accepted words. [2020-07-29 03:15:17,760 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:15:17,773 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:15:17,773 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:15:17,774 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 561 states and 946 transitions. cyclomatic complexity: 386 [2020-07-29 03:15:17,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 561 states and 946 transitions. cyclomatic complexity: 386 [2020-07-29 03:15:17,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:17,774 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:15:17,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:17,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:17,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:17,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 561 letters. Loop has 561 letters. [2020-07-29 03:15:17,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 561 letters. Loop has 561 letters. [2020-07-29 03:15:17,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 561 letters. Loop has 561 letters. [2020-07-29 03:15:17,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 371 letters. Loop has 371 letters. [2020-07-29 03:15:17,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 371 letters. Loop has 371 letters. [2020-07-29 03:15:17,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 371 letters. Loop has 371 letters. [2020-07-29 03:15:17,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:17,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:17,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:15:17,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 85 letters. Loop has 32 letters. [2020-07-29 03:15:17,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 32 letters. [2020-07-29 03:15:17,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 85 letters. Loop has 32 letters. [2020-07-29 03:15:17,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 82 letters. Loop has 32 letters. [2020-07-29 03:15:17,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 32 letters. [2020-07-29 03:15:17,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 82 letters. Loop has 32 letters. [2020-07-29 03:15:17,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:15:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:15:17,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:15:17,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 32 letters. [2020-07-29 03:15:17,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 32 letters. [2020-07-29 03:15:17,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 32 letters. [2020-07-29 03:15:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:17,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:17,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:17,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 36 letters. [2020-07-29 03:15:17,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 36 letters. [2020-07-29 03:15:17,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 36 letters. [2020-07-29 03:15:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:17,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:17,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 36 letters. [2020-07-29 03:15:17,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 36 letters. [2020-07-29 03:15:17,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 36 letters. [2020-07-29 03:15:17,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:17,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:17,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:17,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:15:17,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:15:17,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:15:17,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:15:17,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:15:17,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:15:17,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:17,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:17,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:17,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 36 letters. [2020-07-29 03:15:17,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 36 letters. [2020-07-29 03:15:17,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 36 letters. [2020-07-29 03:15:17,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 32 letters. [2020-07-29 03:15:17,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 32 letters. [2020-07-29 03:15:17,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 32 letters. [2020-07-29 03:15:17,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 32 letters. [2020-07-29 03:15:17,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 32 letters. [2020-07-29 03:15:17,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 32 letters. [2020-07-29 03:15:17,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 80 letters. Loop has 32 letters. [2020-07-29 03:15:17,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 32 letters. [2020-07-29 03:15:17,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 80 letters. Loop has 32 letters. [2020-07-29 03:15:17,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 81 letters. Loop has 32 letters. [2020-07-29 03:15:17,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 32 letters. [2020-07-29 03:15:17,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 81 letters. Loop has 32 letters. [2020-07-29 03:15:17,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:15:17,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:15:17,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:15:17,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:17,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:17,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:17,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:17,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:17,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:17,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:15:17,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:15:17,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:15:17,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:17,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:17,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:17,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:17,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:17,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:17,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 89 letters. Loop has 32 letters. [2020-07-29 03:15:17,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 32 letters. [2020-07-29 03:15:17,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 89 letters. Loop has 32 letters. [2020-07-29 03:15:17,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:15:17,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:15:17,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:15:17,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 36 letters. [2020-07-29 03:15:17,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 36 letters. [2020-07-29 03:15:17,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 36 letters. [2020-07-29 03:15:17,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:17,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:17,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:17,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:17,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:17,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:17,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:17,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:17,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:17,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:17,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:17,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:17,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 36 letters. [2020-07-29 03:15:17,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 36 letters. [2020-07-29 03:15:17,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 36 letters. [2020-07-29 03:15:17,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:15:17,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:15:17,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:15:17,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 81 letters. Loop has 35 letters. [2020-07-29 03:15:17,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 35 letters. [2020-07-29 03:15:17,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 81 letters. Loop has 35 letters. [2020-07-29 03:15:17,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:15:17,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:15:17,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:15:17,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 82 letters. Loop has 35 letters. [2020-07-29 03:15:17,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 35 letters. [2020-07-29 03:15:17,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 82 letters. Loop has 35 letters. [2020-07-29 03:15:17,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:17,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:17,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:17,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:17,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:17,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:15:17,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:15:17,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:15:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:15:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:15:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:15:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 79 letters. Loop has 32 letters. [2020-07-29 03:15:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 32 letters. [2020-07-29 03:15:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 79 letters. Loop has 32 letters. [2020-07-29 03:15:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:15:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:15:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:15:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 36 letters. [2020-07-29 03:15:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 36 letters. [2020-07-29 03:15:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 36 letters. [2020-07-29 03:15:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:17,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:15:17,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 36 letters. [2020-07-29 03:15:17,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 36 letters. [2020-07-29 03:15:17,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 36 letters. [2020-07-29 03:15:17,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 80 letters. Loop has 35 letters. [2020-07-29 03:15:17,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 35 letters. [2020-07-29 03:15:17,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 80 letters. Loop has 35 letters. [2020-07-29 03:15:17,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:17,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:17,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:17,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 79 letters. Loop has 35 letters. [2020-07-29 03:15:17,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 35 letters. [2020-07-29 03:15:17,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 79 letters. Loop has 35 letters. [2020-07-29 03:15:17,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 78 letters. Loop has 35 letters. [2020-07-29 03:15:17,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 35 letters. [2020-07-29 03:15:17,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 78 letters. Loop has 35 letters. [2020-07-29 03:15:17,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 77 letters. Loop has 35 letters. [2020-07-29 03:15:17,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 35 letters. [2020-07-29 03:15:17,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 77 letters. Loop has 35 letters. [2020-07-29 03:15:17,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 35 letters. [2020-07-29 03:15:17,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 35 letters. [2020-07-29 03:15:17,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 35 letters. [2020-07-29 03:15:17,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 35 letters. [2020-07-29 03:15:17,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 35 letters. [2020-07-29 03:15:17,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 35 letters. [2020-07-29 03:15:17,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 35 letters. [2020-07-29 03:15:17,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 35 letters. [2020-07-29 03:15:17,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 35 letters. [2020-07-29 03:15:17,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:17,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:17,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:17,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:17,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:17,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 35 letters. [2020-07-29 03:15:17,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 38 letters. [2020-07-29 03:15:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 38 letters. [2020-07-29 03:15:17,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 38 letters. [2020-07-29 03:15:17,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 56 letters. Loop has 35 letters. [2020-07-29 03:15:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 35 letters. [2020-07-29 03:15:17,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 56 letters. Loop has 35 letters. [2020-07-29 03:15:17,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:17,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:17,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:15:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:15:17,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:15:17,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 39 letters. [2020-07-29 03:15:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 39 letters. [2020-07-29 03:15:17,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 39 letters. [2020-07-29 03:15:17,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:15:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:15:17,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:15:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:17,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:17,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:17,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 89 letters. Loop has 35 letters. [2020-07-29 03:15:17,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 35 letters. [2020-07-29 03:15:17,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 89 letters. Loop has 35 letters. [2020-07-29 03:15:17,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:17,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:17,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:17,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:17,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:17,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 77 letters. Loop has 40 letters. [2020-07-29 03:15:17,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 40 letters. [2020-07-29 03:15:17,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 77 letters. Loop has 40 letters. [2020-07-29 03:15:17,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:17,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:17,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:15:17,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:17,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:17,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:17,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 88 letters. Loop has 35 letters. [2020-07-29 03:15:17,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 35 letters. [2020-07-29 03:15:17,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 88 letters. Loop has 35 letters. [2020-07-29 03:15:17,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:17,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:17,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 38 letters. [2020-07-29 03:15:17,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:17,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:17,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:17,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:17,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:17,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 76 letters. Loop has 40 letters. [2020-07-29 03:15:17,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:15:17,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:15:17,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 87 letters. Loop has 35 letters. [2020-07-29 03:15:17,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 39 letters. [2020-07-29 03:15:17,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 39 letters. [2020-07-29 03:15:17,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 39 letters. [2020-07-29 03:15:17,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:17,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:17,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:15:17,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:17,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:17,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 38 letters. [2020-07-29 03:15:17,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:17,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:17,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:17,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 86 letters. Loop has 35 letters. [2020-07-29 03:15:17,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 35 letters. [2020-07-29 03:15:17,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 86 letters. Loop has 35 letters. [2020-07-29 03:15:17,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 39 letters. [2020-07-29 03:15:17,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 39 letters. [2020-07-29 03:15:17,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 39 letters. [2020-07-29 03:15:17,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:17,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:17,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:17,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:17,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:17,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 75 letters. Loop has 40 letters. [2020-07-29 03:15:17,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 74 letters. Loop has 40 letters. [2020-07-29 03:15:17,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 40 letters. [2020-07-29 03:15:17,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 74 letters. Loop has 40 letters. [2020-07-29 03:15:17,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:17,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:17,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:17,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:17,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:17,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:17,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:17,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:17,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:17,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:17,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:17,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 38 letters. [2020-07-29 03:15:17,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:15:17,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:15:17,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:15:17,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:17,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:17,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:17,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 40 letters. [2020-07-29 03:15:17,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 40 letters. [2020-07-29 03:15:17,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 40 letters. [2020-07-29 03:15:17,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 32 letters. [2020-07-29 03:15:17,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 32 letters. [2020-07-29 03:15:17,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 32 letters. [2020-07-29 03:15:17,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:17,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:17,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:15:17,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 32 letters. [2020-07-29 03:15:17,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 32 letters. [2020-07-29 03:15:17,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 32 letters. [2020-07-29 03:15:17,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:17,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:17,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:17,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 83 letters. Loop has 32 letters. [2020-07-29 03:15:17,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 32 letters. [2020-07-29 03:15:17,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:17,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 83 letters. Loop has 32 letters. [2020-07-29 03:15:18,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 84 letters. Loop has 32 letters. [2020-07-29 03:15:18,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 32 letters. [2020-07-29 03:15:18,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 84 letters. Loop has 32 letters. [2020-07-29 03:15:18,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 39 letters. [2020-07-29 03:15:18,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 39 letters. [2020-07-29 03:15:18,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 39 letters. [2020-07-29 03:15:18,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:15:18,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:15:18,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:15:18,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:15:18,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:15:18,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:15:18,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 35 letters. [2020-07-29 03:15:18,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:15:18,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:15:18,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:15:18,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 38 letters. [2020-07-29 03:15:18,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 39 letters. [2020-07-29 03:15:18,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 39 letters. [2020-07-29 03:15:18,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 39 letters. [2020-07-29 03:15:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 38 letters. [2020-07-29 03:15:18,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 39 letters. [2020-07-29 03:15:18,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 39 letters. [2020-07-29 03:15:18,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 39 letters. [2020-07-29 03:15:18,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:15:18,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:15:18,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:15:18,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:15:18,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 39 letters. [2020-07-29 03:15:18,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 39 letters. [2020-07-29 03:15:18,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 39 letters. [2020-07-29 03:15:18,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 39 letters. [2020-07-29 03:15:18,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 39 letters. [2020-07-29 03:15:18,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 39 letters. [2020-07-29 03:15:18,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 36 letters. [2020-07-29 03:15:18,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 36 letters. [2020-07-29 03:15:18,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 36 letters. [2020-07-29 03:15:18,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 35 letters. [2020-07-29 03:15:18,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 39 letters. [2020-07-29 03:15:18,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 39 letters. [2020-07-29 03:15:18,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 39 letters. [2020-07-29 03:15:18,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 38 letters. [2020-07-29 03:15:18,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 38 letters. [2020-07-29 03:15:18,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 38 letters. [2020-07-29 03:15:18,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 63 letters. Loop has 35 letters. [2020-07-29 03:15:18,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 38 letters. [2020-07-29 03:15:18,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 40 letters. [2020-07-29 03:15:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 40 letters. [2020-07-29 03:15:18,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 40 letters. [2020-07-29 03:15:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:15:18,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 40 letters. [2020-07-29 03:15:18,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 38 letters. [2020-07-29 03:15:18,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:18,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:18,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:18,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:18,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:18,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 40 letters. [2020-07-29 03:15:18,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:15:18,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:15:18,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 32 letters. [2020-07-29 03:15:18,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 35 letters. [2020-07-29 03:15:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 40 letters. [2020-07-29 03:15:18,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 40 letters. [2020-07-29 03:15:18,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 40 letters. [2020-07-29 03:15:18,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 40 letters. [2020-07-29 03:15:18,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:15:18,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:15:18,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:15:18,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 38 letters. [2020-07-29 03:15:18,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 35 letters. [2020-07-29 03:15:18,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 36 letters. [2020-07-29 03:15:18,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 36 letters. [2020-07-29 03:15:18,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 36 letters. [2020-07-29 03:15:18,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 40 letters. [2020-07-29 03:15:18,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 70 letters. Loop has 40 letters. [2020-07-29 03:15:18,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 40 letters. [2020-07-29 03:15:18,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 70 letters. Loop has 40 letters. [2020-07-29 03:15:18,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 83 letters. Loop has 35 letters. [2020-07-29 03:15:18,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 35 letters. [2020-07-29 03:15:18,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 83 letters. Loop has 35 letters. [2020-07-29 03:15:18,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 35 letters. [2020-07-29 03:15:18,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 36 letters. [2020-07-29 03:15:18,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 36 letters. [2020-07-29 03:15:18,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 36 letters. [2020-07-29 03:15:18,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 36 letters. [2020-07-29 03:15:18,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 36 letters. [2020-07-29 03:15:18,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 36 letters. [2020-07-29 03:15:18,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 35 letters. [2020-07-29 03:15:18,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 77 letters. Loop has 32 letters. [2020-07-29 03:15:18,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 32 letters. [2020-07-29 03:15:18,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 77 letters. Loop has 32 letters. [2020-07-29 03:15:18,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 78 letters. Loop has 32 letters. [2020-07-29 03:15:18,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 32 letters. [2020-07-29 03:15:18,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 78 letters. Loop has 32 letters. [2020-07-29 03:15:18,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:15:18,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 35 letters. [2020-07-29 03:15:18,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:15:18,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:15:18,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 32 letters. [2020-07-29 03:15:18,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 36 letters. [2020-07-29 03:15:18,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 36 letters. [2020-07-29 03:15:18,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 36 letters. [2020-07-29 03:15:18,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 60 letters. Loop has 35 letters. [2020-07-29 03:15:18,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:15:18,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:15:18,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 86 letters. Loop has 32 letters. [2020-07-29 03:15:18,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 32 letters. [2020-07-29 03:15:18,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 86 letters. Loop has 32 letters. [2020-07-29 03:15:18,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 87 letters. Loop has 32 letters. [2020-07-29 03:15:18,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 32 letters. [2020-07-29 03:15:18,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 87 letters. Loop has 32 letters. [2020-07-29 03:15:18,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 36 letters. [2020-07-29 03:15:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 36 letters. [2020-07-29 03:15:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 36 letters. [2020-07-29 03:15:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 64 letters. Loop has 35 letters. [2020-07-29 03:15:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:15:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:15:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:15:18,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:15:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:15:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:15:18,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 36 letters. [2020-07-29 03:15:18,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 36 letters. [2020-07-29 03:15:18,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 36 letters. [2020-07-29 03:15:18,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 71 letters. Loop has 35 letters. [2020-07-29 03:15:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:15:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:15:18,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:15:18,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 66 letters. Loop has 35 letters. [2020-07-29 03:15:18,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 88 letters. Loop has 32 letters. [2020-07-29 03:15:18,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 32 letters. [2020-07-29 03:15:18,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 88 letters. Loop has 32 letters. [2020-07-29 03:15:18,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:18,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:18,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 57 letters. Loop has 35 letters. [2020-07-29 03:15:18,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 35 letters. [2020-07-29 03:15:18,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 58 letters. Loop has 35 letters. [2020-07-29 03:15:18,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:15:18,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:15:18,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:15:18,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 59 letters. Loop has 35 letters. [2020-07-29 03:15:18,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:18,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:18,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 62 letters. Loop has 36 letters. [2020-07-29 03:15:18,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 84 letters. Loop has 35 letters. [2020-07-29 03:15:18,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 35 letters. [2020-07-29 03:15:18,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 84 letters. Loop has 35 letters. [2020-07-29 03:15:18,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 85 letters. Loop has 35 letters. [2020-07-29 03:15:18,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 35 letters. [2020-07-29 03:15:18,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 85 letters. Loop has 35 letters. [2020-07-29 03:15:18,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 65 letters. Loop has 36 letters. [2020-07-29 03:15:18,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 36 letters. [2020-07-29 03:15:18,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 65 letters. Loop has 36 letters. [2020-07-29 03:15:18,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:15:18,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:15:18,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 371 states and 638 transitions. cyclomatic complexity: 268 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:18,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:18,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 561 states and 946 transitions. cyclomatic complexity: 386 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:15:18,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,174 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:15:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:15:18,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2020-07-29 03:15:18,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 55 letters. Loop has 35 letters. [2020-07-29 03:15:18,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 90 letters. Loop has 35 letters. [2020-07-29 03:15:18,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 504 transitions. Stem has 55 letters. Loop has 70 letters. [2020-07-29 03:15:18,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:15:18,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 561 states and 946 transitions. cyclomatic complexity: 386 [2020-07-29 03:15:18,215 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:18,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 561 states to 0 states and 0 transitions. [2020-07-29 03:15:18,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:15:18,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:15:18,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:15:18,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:18,217 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:18,217 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:18,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:15:18,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:15:18,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:15:18,218 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2020-07-29 03:15:18,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:15:18,218 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:15:18,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:15:18,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:15:18,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:15:18,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:15:18,297 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:18,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:15:18,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:15:18,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:15:18,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:15:18,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:15:18,298 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:18,298 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:18,298 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:15:18,298 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:15:18,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:15:18,299 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:15:18,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:15:18,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:15:18 BoogieIcfgContainer [2020-07-29 03:15:18,306 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:15:18,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:15:18,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:15:18,307 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:15:18,308 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:15:05" (3/4) ... [2020-07-29 03:15:18,312 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:15:18,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:15:18,315 INFO L168 Benchmark]: Toolchain (without parser) took 16092.44 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 412.6 MB). Free memory was 957.5 MB in the beginning and 809.0 MB in the end (delta: 148.5 MB). Peak memory consumption was 561.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:18,315 INFO L168 Benchmark]: CDTParser took 0.16 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:15:18,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 727.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:18,320 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:18,321 INFO L168 Benchmark]: Boogie Preprocessor took 65.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:15:18,324 INFO L168 Benchmark]: RCFGBuilder took 2243.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.3 MB in the end (delta: 185.3 MB). Peak memory consumption was 185.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:18,325 INFO L168 Benchmark]: BuchiAutomizer took 12932.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.8 MB). Free memory was 914.3 MB in the beginning and 809.0 MB in the end (delta: 105.3 MB). Peak memory consumption was 381.1 MB. Max. memory is 11.5 GB. [2020-07-29 03:15:18,325 INFO L168 Benchmark]: Witness Printer took 5.23 ms. Allocated memory is still 1.4 GB. Free memory is still 809.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:15:18,331 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.16 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 727.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2243.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 914.3 MB in the end (delta: 185.3 MB). Peak memory consumption was 185.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12932.17 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 275.8 MB). Free memory was 914.3 MB in the beginning and 809.0 MB in the end (delta: 105.3 MB). Peak memory consumption was 381.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 ms. Allocated memory is still 1.4 GB. Free memory is still 809.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.5s. Construction of modules took 0.0s. Büchi inclusion checks took 4.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 371 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1520 SDtfs, 763 SDslu, 2189 SDs, 0 SdLazy, 35 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax121 hnf104 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...