./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.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 701a5715f583767fd2ceaf41d855d463d2f5d414 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:20:01,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:20:01,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:20:01,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:20:01,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:20:01,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:20:01,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:20:01,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:20:01,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:20:01,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:20:01,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:20:01,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:20:01,898 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:20:01,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:20:01,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:20:01,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:20:01,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:20:01,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:20:01,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:20:01,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:20:01,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:20:01,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:20:01,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:20:01,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:20:01,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:20:01,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:20:01,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:20:01,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:20:01,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:20:01,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:20:01,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:20:01,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:20:01,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:20:01,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:20:01,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:20:01,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:20:01,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:20:01,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:20:01,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:20:01,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:20:01,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:20:01,925 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:20:01,942 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:20:01,942 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:20:01,943 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:20:01,944 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:20:01,944 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:20:01,944 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:20:01,944 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:20:01,945 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:20:01,945 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:20:01,945 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:20:01,946 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:20:01,946 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:20:01,946 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:20:01,946 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:20:01,947 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:20:01,947 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:20:01,947 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:20:01,947 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:20:01,948 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:20:01,948 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:20:01,948 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:20:01,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:20:01,949 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:20:01,949 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:20:01,949 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:20:01,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:20:01,950 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:20:01,950 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:20:01,951 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:20:01,951 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:20:01,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:20:01,951 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:20:01,952 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:20:01,953 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 -> 701a5715f583767fd2ceaf41d855d463d2f5d414 [2020-07-29 03:20:02,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:20:02,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:20:02,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:20:02,272 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:20:02,273 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:20:02,273 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2020-07-29 03:20:02,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7eb2945/ecabf92e28824a2f8de0ca800769708a/FLAG57b1d9a34 [2020-07-29 03:20:02,831 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:20:02,832 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2020-07-29 03:20:02,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7eb2945/ecabf92e28824a2f8de0ca800769708a/FLAG57b1d9a34 [2020-07-29 03:20:03,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7eb2945/ecabf92e28824a2f8de0ca800769708a [2020-07-29 03:20:03,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:20:03,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:20:03,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:20:03,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:20:03,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:20:03,189 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,192 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d9ae94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03, skipping insertion in model container [2020-07-29 03:20:03,192 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:20:03,265 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:20:03,580 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:20:03,655 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:20:03,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:20:03,761 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:20:03,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03 WrapperNode [2020-07-29 03:20:03,762 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:20:03,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:20:03,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:20:03,763 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:20:03,772 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:20:03" (1/1) ... [2020-07-29 03:20:03,784 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:20:03" (1/1) ... [2020-07-29 03:20:03,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:20:03,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:20:03,848 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:20:03,848 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:20:03,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,877 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (1/1) ... [2020-07-29 03:20:03,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:20:03,897 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:20:03,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:20:03,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:20:03,898 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (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:20:03,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:20:03,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:20:04,943 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:20:04,943 INFO L295 CfgBuilder]: Removed 27 assume(true) statements. [2020-07-29 03:20:04,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:04 BoogieIcfgContainer [2020-07-29 03:20:04,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:20:04,955 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:20:04,955 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:20:04,959 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:20:04,960 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:04,960 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:20:03" (1/3) ... [2020-07-29 03:20:04,962 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1462f856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:20:04, skipping insertion in model container [2020-07-29 03:20:04,962 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:04,962 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:20:03" (2/3) ... [2020-07-29 03:20:04,963 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1462f856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:20:04, skipping insertion in model container [2020-07-29 03:20:04,963 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:20:04,964 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:04" (3/3) ... [2020-07-29 03:20:04,965 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c [2020-07-29 03:20:05,016 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:20:05,016 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:20:05,016 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:20:05,016 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:20:05,017 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:20:05,017 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:20:05,018 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:20:05,018 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:20:05,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2020-07-29 03:20:05,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2020-07-29 03:20:05,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:05,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:05,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:05,105 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] [2020-07-29 03:20:05,105 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:20:05,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 127 states. [2020-07-29 03:20:05,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2020-07-29 03:20:05,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:05,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:05,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:20:05,135 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] [2020-07-29 03:20:05,143 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 12#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 16#L307true assume !(0 == ~r1~0);init_~tmp~0 := 0; 18#L307-1true init_#res := init_~tmp~0; 19#L508true main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 45#L67true assume !(0 == assume_abort_if_not_~cond); 95#L66true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 64#L592-2true [2020-07-29 03:20:05,148 INFO L796 eck$LassoCheckResult]: Loop: 64#L592-2true assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 61#L130true assume !(0 != ~mode1~0 % 256); 37#L144true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 46#L144-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 57#L130-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 121#L156true assume !(0 != ~mode2~0 % 256); 24#L169true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 23#L169-2true ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 116#L156-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 125#L181true assume !(0 != ~mode3~0 % 256); 28#L194true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 26#L194-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 98#L181-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 111#L206true assume !(0 != ~mode4~0 % 256); 3#L219true assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite3 := ~p4_new~0; 20#L219-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 107#L206-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 89#L231true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 91#L234true assume !(node5_~m5~0 != ~nomsg~0); 68#L234-1true ~mode5~0 := 0; 81#L231-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 93#L256true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 76#L259true assume !(node6_~m6~0 != ~nomsg~0); 73#L259-1true ~mode6~0 := 0; 67#L256-2true havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 80#L281true assume !(0 != ~mode7~0 % 256); 96#L294true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; 113#L294-2true ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; 72#L281-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 21#L516true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 22#L516-1true check_#res := check_~tmp~1; 118#L536true main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 55#L628true assume !(0 == assert_~arg % 256); 47#L623true main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 64#L592-2true [2020-07-29 03:20:05,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2020-07-29 03:20:05,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:05,163 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968110088] [2020-07-29 03:20:05,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:05,415 INFO L280 TraceCheckUtils]: 0: Hoare triple {131#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; {131#true} is VALID [2020-07-29 03:20:05,415 INFO L280 TraceCheckUtils]: 1: Hoare triple {131#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {131#true} is VALID [2020-07-29 03:20:05,416 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {133#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:20:05,417 INFO L280 TraceCheckUtils]: 3: Hoare triple {133#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {134#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:20:05,418 INFO L280 TraceCheckUtils]: 4: Hoare triple {134#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {135#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:20:05,419 INFO L280 TraceCheckUtils]: 5: Hoare triple {135#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {132#false} is VALID [2020-07-29 03:20:05,420 INFO L280 TraceCheckUtils]: 6: Hoare triple {132#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; {132#false} is VALID [2020-07-29 03:20:05,422 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:20:05,423 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968110088] [2020-07-29 03:20:05,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:05,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:05,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568117254] [2020-07-29 03:20:05,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:20:05,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1226509104, now seen corresponding path program 1 times [2020-07-29 03:20:05,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:05,431 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300860303] [2020-07-29 03:20:05,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:05,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {136#true} assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {136#true} assume !(0 != ~mode1~0 % 256); {136#true} is VALID [2020-07-29 03:20:05,662 INFO L280 TraceCheckUtils]: 2: Hoare triple {136#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; {136#true} is VALID [2020-07-29 03:20:05,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {136#true} ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; {136#true} is VALID [2020-07-29 03:20:05,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {136#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,663 INFO L280 TraceCheckUtils]: 5: Hoare triple {136#true} assume !(0 != ~mode2~0 % 256); {136#true} is VALID [2020-07-29 03:20:05,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {136#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {136#true} is VALID [2020-07-29 03:20:05,664 INFO L280 TraceCheckUtils]: 7: Hoare triple {136#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {136#true} is VALID [2020-07-29 03:20:05,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {136#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {136#true} assume !(0 != ~mode3~0 % 256); {136#true} is VALID [2020-07-29 03:20:05,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {136#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {136#true} is VALID [2020-07-29 03:20:05,666 INFO L280 TraceCheckUtils]: 11: Hoare triple {136#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {136#true} is VALID [2020-07-29 03:20:05,667 INFO L280 TraceCheckUtils]: 12: Hoare triple {136#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,667 INFO L280 TraceCheckUtils]: 13: Hoare triple {136#true} assume !(0 != ~mode4~0 % 256); {136#true} is VALID [2020-07-29 03:20:05,668 INFO L280 TraceCheckUtils]: 14: Hoare triple {136#true} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite3 := ~p4_new~0; {136#true} is VALID [2020-07-29 03:20:05,668 INFO L280 TraceCheckUtils]: 15: Hoare triple {136#true} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {136#true} is VALID [2020-07-29 03:20:05,669 INFO L280 TraceCheckUtils]: 16: Hoare triple {136#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,669 INFO L280 TraceCheckUtils]: 17: Hoare triple {136#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,670 INFO L280 TraceCheckUtils]: 18: Hoare triple {136#true} assume !(node5_~m5~0 != ~nomsg~0); {136#true} is VALID [2020-07-29 03:20:05,670 INFO L280 TraceCheckUtils]: 19: Hoare triple {136#true} ~mode5~0 := 0; {136#true} is VALID [2020-07-29 03:20:05,670 INFO L280 TraceCheckUtils]: 20: Hoare triple {136#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,671 INFO L280 TraceCheckUtils]: 21: Hoare triple {136#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,672 INFO L280 TraceCheckUtils]: 22: Hoare triple {136#true} assume !(node6_~m6~0 != ~nomsg~0); {136#true} is VALID [2020-07-29 03:20:05,672 INFO L280 TraceCheckUtils]: 23: Hoare triple {136#true} ~mode6~0 := 0; {136#true} is VALID [2020-07-29 03:20:05,673 INFO L280 TraceCheckUtils]: 24: Hoare triple {136#true} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {136#true} is VALID [2020-07-29 03:20:05,673 INFO L280 TraceCheckUtils]: 25: Hoare triple {136#true} assume !(0 != ~mode7~0 % 256); {136#true} is VALID [2020-07-29 03:20:05,673 INFO L280 TraceCheckUtils]: 26: Hoare triple {136#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; {136#true} is VALID [2020-07-29 03:20:05,674 INFO L280 TraceCheckUtils]: 27: Hoare triple {136#true} ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; {136#true} is VALID [2020-07-29 03:20:05,674 INFO L280 TraceCheckUtils]: 28: Hoare triple {136#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {136#true} is VALID [2020-07-29 03:20:05,680 INFO L280 TraceCheckUtils]: 29: Hoare triple {136#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; {138#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:20:05,681 INFO L280 TraceCheckUtils]: 30: Hoare triple {138#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {139#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:20:05,683 INFO L280 TraceCheckUtils]: 31: Hoare triple {139#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {140#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:20:05,684 INFO L280 TraceCheckUtils]: 32: Hoare triple {140#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {137#false} is VALID [2020-07-29 03:20:05,685 INFO L280 TraceCheckUtils]: 33: Hoare triple {137#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {137#false} is VALID [2020-07-29 03:20:05,696 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:20:05,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300860303] [2020-07-29 03:20:05,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:05,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:05,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091906571] [2020-07-29 03:20:05,702 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:05,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:05,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:20:05,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:20:05,728 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 5 states. [2020-07-29 03:20:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:06,572 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2020-07-29 03:20:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:20:06,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:20:06,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:06,593 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2020-07-29 03:20:06,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-07-29 03:20:06,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 162 transitions. [2020-07-29 03:20:06,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2020-07-29 03:20:06,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2020-07-29 03:20:06,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2020-07-29 03:20:06,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:06,617 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2020-07-29 03:20:06,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2020-07-29 03:20:06,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-07-29 03:20:06,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:06,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 162 transitions. Second operand 122 states. [2020-07-29 03:20:06,657 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 162 transitions. Second operand 122 states. [2020-07-29 03:20:06,659 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. Second operand 122 states. [2020-07-29 03:20:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:06,670 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2020-07-29 03:20:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2020-07-29 03:20:06,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:06,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:06,681 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states and 162 transitions. [2020-07-29 03:20:06,681 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states and 162 transitions. [2020-07-29 03:20:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:06,690 INFO L93 Difference]: Finished difference Result 122 states and 162 transitions. [2020-07-29 03:20:06,690 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 162 transitions. [2020-07-29 03:20:06,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:06,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:06,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:06,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 03:20:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2020-07-29 03:20:06,703 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2020-07-29 03:20:06,703 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2020-07-29 03:20:06,704 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:20:06,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2020-07-29 03:20:06,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-07-29 03:20:06,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:06,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:06,715 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, 1] [2020-07-29 03:20:06,716 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] [2020-07-29 03:20:06,718 INFO L794 eck$LassoCheckResult]: Stem: 387#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 292#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 293#L307 assume 0 == ~r1~0; 300#L308 assume ~id1~0 >= 0; 357#L309 assume 0 == ~st1~0; 290#L310 assume ~send1~0 == ~id1~0; 291#L311 assume 0 == ~mode1~0 % 256; 337#L312 assume ~id2~0 >= 0; 338#L313 assume 0 == ~st2~0; 381#L314 assume ~send2~0 == ~id2~0; 323#L315 assume 0 == ~mode2~0 % 256; 324#L316 assume ~id3~0 >= 0; 363#L317 assume 0 == ~st3~0; 298#L318 assume ~send3~0 == ~id3~0; 299#L319 assume 0 == ~mode3~0 % 256; 356#L320 assume ~id4~0 >= 0; 285#L321 assume 0 == ~st4~0; 286#L322 assume ~send4~0 == ~id4~0; 333#L323 assume 0 == ~mode4~0 % 256; 334#L324 assume ~id5~0 >= 0; 379#L325 assume 0 == ~st5~0; 321#L326 assume ~send5~0 == ~id5~0; 322#L327 assume 0 == ~mode5~0 % 256; 362#L328 assume ~id6~0 >= 0; 296#L329 assume 0 == ~st6~0; 297#L330 assume ~send6~0 == ~id6~0; 355#L331 assume 0 == ~mode6~0 % 256; 283#L332 assume ~id7~0 >= 0; 284#L333 assume 0 == ~st7~0; 331#L334 assume ~send7~0 == ~id7~0; 332#L335 assume 0 == ~mode7~0 % 256; 377#L336 assume ~id1~0 != ~id2~0; 318#L337 assume ~id1~0 != ~id3~0; 319#L338 assume ~id1~0 != ~id4~0; 360#L339 assume ~id1~0 != ~id5~0; 294#L340 assume ~id1~0 != ~id6~0; 295#L341 assume ~id1~0 != ~id7~0; 354#L342 assume ~id2~0 != ~id3~0; 279#L343 assume ~id2~0 != ~id4~0; 280#L344 assume ~id2~0 != ~id5~0; 329#L345 assume ~id2~0 != ~id6~0; 330#L346 assume ~id2~0 != ~id7~0; 376#L347 assume ~id3~0 != ~id4~0; 316#L348 assume ~id3~0 != ~id5~0; 317#L349 assume ~id3~0 != ~id6~0; 359#L350 assume ~id3~0 != ~id7~0; 312#L351 assume ~id4~0 != ~id5~0; 313#L352 assume ~id4~0 != ~id6~0; 353#L353 assume ~id4~0 != ~id7~0; 277#L354 assume ~id5~0 != ~id6~0; 278#L355 assume ~id5~0 != ~id7~0; 328#L356 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 301#L307-1 init_#res := init_~tmp~0; 302#L508 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 303#L67 assume !(0 == assume_abort_if_not_~cond); 347#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 350#L592-2 [2020-07-29 03:20:06,718 INFO L796 eck$LassoCheckResult]: Loop: 350#L592-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 364#L130 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 365#L134 assume !(node1_~m1~0 != ~nomsg~0); 370#L134-1 ~mode1~0 := 0; 348#L130-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 361#L156 assume !(0 != ~mode2~0 % 256); 311#L169 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 309#L169-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 310#L156-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 393#L181 assume !(0 != ~mode3~0 % 256); 320#L194 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 314#L194-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 315#L181-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 391#L206 assume !(0 != ~mode4~0 % 256); 275#L219 assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite3 := ~p4_new~0; 276#L219-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 304#L206-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 384#L231 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 385#L234 assume !(node5_~m5~0 != ~nomsg~0); 326#L234-1 ~mode5~0 := 0; 374#L231-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 382#L256 assume !(0 != ~mode6~0 % 256); 388#L269 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 396#L269-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 372#L256-2 havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 373#L281 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 352#L284 assume !(node7_~m7~0 != ~nomsg~0); 288#L284-1 ~mode7~0 := 0; 351#L281-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 305#L516 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 306#L516-1 check_#res := check_~tmp~1; 308#L536 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 358#L628 assume !(0 == assert_~arg % 256); 349#L623 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 350#L592-2 [2020-07-29 03:20:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2020-07-29 03:20:06,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:06,720 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621106142] [2020-07-29 03:20:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:06,809 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:06,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:06,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash 940757082, now seen corresponding path program 1 times [2020-07-29 03:20:06,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:06,965 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520494058] [2020-07-29 03:20:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:07,086 INFO L280 TraceCheckUtils]: 0: Hoare triple {646#true} assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,087 INFO L280 TraceCheckUtils]: 1: Hoare triple {646#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,087 INFO L280 TraceCheckUtils]: 2: Hoare triple {646#true} assume !(node1_~m1~0 != ~nomsg~0); {646#true} is VALID [2020-07-29 03:20:07,088 INFO L280 TraceCheckUtils]: 3: Hoare triple {646#true} ~mode1~0 := 0; {646#true} is VALID [2020-07-29 03:20:07,088 INFO L280 TraceCheckUtils]: 4: Hoare triple {646#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,088 INFO L280 TraceCheckUtils]: 5: Hoare triple {646#true} assume !(0 != ~mode2~0 % 256); {646#true} is VALID [2020-07-29 03:20:07,088 INFO L280 TraceCheckUtils]: 6: Hoare triple {646#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {646#true} is VALID [2020-07-29 03:20:07,089 INFO L280 TraceCheckUtils]: 7: Hoare triple {646#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {646#true} is VALID [2020-07-29 03:20:07,089 INFO L280 TraceCheckUtils]: 8: Hoare triple {646#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,090 INFO L280 TraceCheckUtils]: 9: Hoare triple {646#true} assume !(0 != ~mode3~0 % 256); {646#true} is VALID [2020-07-29 03:20:07,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {646#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; {646#true} is VALID [2020-07-29 03:20:07,090 INFO L280 TraceCheckUtils]: 11: Hoare triple {646#true} ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; {646#true} is VALID [2020-07-29 03:20:07,091 INFO L280 TraceCheckUtils]: 12: Hoare triple {646#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,091 INFO L280 TraceCheckUtils]: 13: Hoare triple {646#true} assume !(0 != ~mode4~0 % 256); {646#true} is VALID [2020-07-29 03:20:07,091 INFO L280 TraceCheckUtils]: 14: Hoare triple {646#true} assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite3 := ~p4_new~0; {646#true} is VALID [2020-07-29 03:20:07,092 INFO L280 TraceCheckUtils]: 15: Hoare triple {646#true} ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; {646#true} is VALID [2020-07-29 03:20:07,092 INFO L280 TraceCheckUtils]: 16: Hoare triple {646#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,092 INFO L280 TraceCheckUtils]: 17: Hoare triple {646#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,093 INFO L280 TraceCheckUtils]: 18: Hoare triple {646#true} assume !(node5_~m5~0 != ~nomsg~0); {646#true} is VALID [2020-07-29 03:20:07,093 INFO L280 TraceCheckUtils]: 19: Hoare triple {646#true} ~mode5~0 := 0; {646#true} is VALID [2020-07-29 03:20:07,094 INFO L280 TraceCheckUtils]: 20: Hoare triple {646#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,094 INFO L280 TraceCheckUtils]: 21: Hoare triple {646#true} assume !(0 != ~mode6~0 % 256); {646#true} is VALID [2020-07-29 03:20:07,095 INFO L280 TraceCheckUtils]: 22: Hoare triple {646#true} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; {646#true} is VALID [2020-07-29 03:20:07,095 INFO L280 TraceCheckUtils]: 23: Hoare triple {646#true} ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; {646#true} is VALID [2020-07-29 03:20:07,095 INFO L280 TraceCheckUtils]: 24: Hoare triple {646#true} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,096 INFO L280 TraceCheckUtils]: 25: Hoare triple {646#true} assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {646#true} is VALID [2020-07-29 03:20:07,096 INFO L280 TraceCheckUtils]: 26: Hoare triple {646#true} assume !(node7_~m7~0 != ~nomsg~0); {646#true} is VALID [2020-07-29 03:20:07,096 INFO L280 TraceCheckUtils]: 27: Hoare triple {646#true} ~mode7~0 := 0; {646#true} is VALID [2020-07-29 03:20:07,097 INFO L280 TraceCheckUtils]: 28: Hoare triple {646#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {646#true} is VALID [2020-07-29 03:20:07,098 INFO L280 TraceCheckUtils]: 29: Hoare triple {646#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; {648#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:20:07,099 INFO L280 TraceCheckUtils]: 30: Hoare triple {648#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {649#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:20:07,101 INFO L280 TraceCheckUtils]: 31: Hoare triple {649#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {650#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:20:07,104 INFO L280 TraceCheckUtils]: 32: Hoare triple {650#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {647#false} is VALID [2020-07-29 03:20:07,104 INFO L280 TraceCheckUtils]: 33: Hoare triple {647#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {647#false} is VALID [2020-07-29 03:20:07,107 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:20:07,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520494058] [2020-07-29 03:20:07,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:07,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:20:07,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959464954] [2020-07-29 03:20:07,109 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:07,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:07,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:20:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:20:07,110 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand 5 states. [2020-07-29 03:20:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:07,668 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2020-07-29 03:20:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:20:07,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:20:07,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:07,713 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2020-07-29 03:20:07,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-07-29 03:20:07,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2020-07-29 03:20:07,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2020-07-29 03:20:07,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2020-07-29 03:20:07,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2020-07-29 03:20:07,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:07,729 INFO L688 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2020-07-29 03:20:07,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2020-07-29 03:20:07,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2020-07-29 03:20:07,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:07,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states and 159 transitions. Second operand 122 states. [2020-07-29 03:20:07,747 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states and 159 transitions. Second operand 122 states. [2020-07-29 03:20:07,747 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. Second operand 122 states. [2020-07-29 03:20:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:07,757 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2020-07-29 03:20:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2020-07-29 03:20:07,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:07,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:07,762 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 122 states and 159 transitions. [2020-07-29 03:20:07,762 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 122 states and 159 transitions. [2020-07-29 03:20:07,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:07,769 INFO L93 Difference]: Finished difference Result 122 states and 159 transitions. [2020-07-29 03:20:07,769 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 159 transitions. [2020-07-29 03:20:07,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:07,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:07,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:07,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:07,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-29 03:20:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2020-07-29 03:20:07,784 INFO L711 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2020-07-29 03:20:07,784 INFO L591 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2020-07-29 03:20:07,784 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:20:07,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2020-07-29 03:20:07,787 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2020-07-29 03:20:07,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:07,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:07,792 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, 1] [2020-07-29 03:20:07,792 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, 1] [2020-07-29 03:20:07,793 INFO L794 eck$LassoCheckResult]: Stem: 892#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 797#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 798#L307 assume 0 == ~r1~0; 805#L308 assume ~id1~0 >= 0; 862#L309 assume 0 == ~st1~0; 792#L310 assume ~send1~0 == ~id1~0; 793#L311 assume 0 == ~mode1~0 % 256; 842#L312 assume ~id2~0 >= 0; 843#L313 assume 0 == ~st2~0; 885#L314 assume ~send2~0 == ~id2~0; 828#L315 assume 0 == ~mode2~0 % 256; 829#L316 assume ~id3~0 >= 0; 868#L317 assume 0 == ~st3~0; 803#L318 assume ~send3~0 == ~id3~0; 804#L319 assume 0 == ~mode3~0 % 256; 861#L320 assume ~id4~0 >= 0; 790#L321 assume 0 == ~st4~0; 791#L322 assume ~send4~0 == ~id4~0; 838#L323 assume 0 == ~mode4~0 % 256; 839#L324 assume ~id5~0 >= 0; 884#L325 assume 0 == ~st5~0; 826#L326 assume ~send5~0 == ~id5~0; 827#L327 assume 0 == ~mode5~0 % 256; 867#L328 assume ~id6~0 >= 0; 801#L329 assume 0 == ~st6~0; 802#L330 assume ~send6~0 == ~id6~0; 860#L331 assume 0 == ~mode6~0 % 256; 786#L332 assume ~id7~0 >= 0; 787#L333 assume 0 == ~st7~0; 836#L334 assume ~send7~0 == ~id7~0; 837#L335 assume 0 == ~mode7~0 % 256; 882#L336 assume ~id1~0 != ~id2~0; 823#L337 assume ~id1~0 != ~id3~0; 824#L338 assume ~id1~0 != ~id4~0; 865#L339 assume ~id1~0 != ~id5~0; 799#L340 assume ~id1~0 != ~id6~0; 800#L341 assume ~id1~0 != ~id7~0; 859#L342 assume ~id2~0 != ~id3~0; 784#L343 assume ~id2~0 != ~id4~0; 785#L344 assume ~id2~0 != ~id5~0; 834#L345 assume ~id2~0 != ~id6~0; 835#L346 assume ~id2~0 != ~id7~0; 881#L347 assume ~id3~0 != ~id4~0; 821#L348 assume ~id3~0 != ~id5~0; 822#L349 assume ~id3~0 != ~id6~0; 864#L350 assume ~id3~0 != ~id7~0; 817#L351 assume ~id4~0 != ~id5~0; 818#L352 assume ~id4~0 != ~id6~0; 858#L353 assume ~id4~0 != ~id7~0; 782#L354 assume ~id5~0 != ~id6~0; 783#L355 assume ~id5~0 != ~id7~0; 833#L356 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 806#L307-1 init_#res := init_~tmp~0; 807#L508 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 808#L67 assume !(0 == assume_abort_if_not_~cond); 852#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 855#L592-2 [2020-07-29 03:20:07,796 INFO L796 eck$LassoCheckResult]: Loop: 855#L592-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 869#L130 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 870#L134 assume !(node1_~m1~0 != ~nomsg~0); 875#L134-1 ~mode1~0 := 0; 853#L130-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 866#L156 assume !(0 != ~mode2~0 % 256); 816#L169 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 814#L169-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 815#L156-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 898#L181 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 897#L184 assume !(node3_~m3~0 != ~nomsg~0); 845#L184-1 ~mode3~0 := 0; 820#L181-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 896#L206 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 888#L209 assume !(node4_~m4~0 != ~nomsg~0); 847#L209-1 ~mode4~0 := 0; 809#L206-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 889#L231 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 890#L234 assume !(node5_~m5~0 != ~nomsg~0); 831#L234-1 ~mode5~0 := 0; 879#L231-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 887#L256 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 883#L259 assume !(node6_~m6~0 != ~nomsg~0); 789#L259-1 ~mode6~0 := 0; 877#L256-2 havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 878#L281 assume !(0 != ~mode7~0 % 256); 886#L294 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; 895#L294-2 ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; 856#L281-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 810#L516 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 811#L517 assume ~r1~0 >= 7; 849#L521 assume ~r1~0 < 7;check_~tmp~1 := 1; 812#L516-1 check_#res := check_~tmp~1; 813#L536 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L628 assume !(0 == assert_~arg % 256); 854#L623 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 855#L592-2 [2020-07-29 03:20:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2020-07-29 03:20:07,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:07,798 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899572373] [2020-07-29 03:20:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:07,855 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:07,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:07,934 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:07,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:07,935 INFO L82 PathProgramCache]: Analyzing trace with hash -154730080, now seen corresponding path program 1 times [2020-07-29 03:20:07,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:07,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945570019] [2020-07-29 03:20:07,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:07,972 INFO L280 TraceCheckUtils]: 0: Hoare triple {1151#true} assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,973 INFO L280 TraceCheckUtils]: 1: Hoare triple {1151#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {1151#true} assume !(node1_~m1~0 != ~nomsg~0); {1151#true} is VALID [2020-07-29 03:20:07,973 INFO L280 TraceCheckUtils]: 3: Hoare triple {1151#true} ~mode1~0 := 0; {1151#true} is VALID [2020-07-29 03:20:07,974 INFO L280 TraceCheckUtils]: 4: Hoare triple {1151#true} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,974 INFO L280 TraceCheckUtils]: 5: Hoare triple {1151#true} assume !(0 != ~mode2~0 % 256); {1151#true} is VALID [2020-07-29 03:20:07,974 INFO L280 TraceCheckUtils]: 6: Hoare triple {1151#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; {1151#true} is VALID [2020-07-29 03:20:07,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {1151#true} ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; {1151#true} is VALID [2020-07-29 03:20:07,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {1151#true} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,975 INFO L280 TraceCheckUtils]: 9: Hoare triple {1151#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {1151#true} assume !(node3_~m3~0 != ~nomsg~0); {1151#true} is VALID [2020-07-29 03:20:07,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {1151#true} ~mode3~0 := 0; {1151#true} is VALID [2020-07-29 03:20:07,975 INFO L280 TraceCheckUtils]: 12: Hoare triple {1151#true} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,976 INFO L280 TraceCheckUtils]: 13: Hoare triple {1151#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,976 INFO L280 TraceCheckUtils]: 14: Hoare triple {1151#true} assume !(node4_~m4~0 != ~nomsg~0); {1151#true} is VALID [2020-07-29 03:20:07,976 INFO L280 TraceCheckUtils]: 15: Hoare triple {1151#true} ~mode4~0 := 0; {1151#true} is VALID [2020-07-29 03:20:07,976 INFO L280 TraceCheckUtils]: 16: Hoare triple {1151#true} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,977 INFO L280 TraceCheckUtils]: 17: Hoare triple {1151#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,977 INFO L280 TraceCheckUtils]: 18: Hoare triple {1151#true} assume !(node5_~m5~0 != ~nomsg~0); {1151#true} is VALID [2020-07-29 03:20:07,977 INFO L280 TraceCheckUtils]: 19: Hoare triple {1151#true} ~mode5~0 := 0; {1151#true} is VALID [2020-07-29 03:20:07,977 INFO L280 TraceCheckUtils]: 20: Hoare triple {1151#true} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,978 INFO L280 TraceCheckUtils]: 21: Hoare triple {1151#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,978 INFO L280 TraceCheckUtils]: 22: Hoare triple {1151#true} assume !(node6_~m6~0 != ~nomsg~0); {1151#true} is VALID [2020-07-29 03:20:07,978 INFO L280 TraceCheckUtils]: 23: Hoare triple {1151#true} ~mode6~0 := 0; {1151#true} is VALID [2020-07-29 03:20:07,978 INFO L280 TraceCheckUtils]: 24: Hoare triple {1151#true} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {1151#true} is VALID [2020-07-29 03:20:07,979 INFO L280 TraceCheckUtils]: 25: Hoare triple {1151#true} assume !(0 != ~mode7~0 % 256); {1151#true} is VALID [2020-07-29 03:20:07,979 INFO L280 TraceCheckUtils]: 26: Hoare triple {1151#true} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; {1151#true} is VALID [2020-07-29 03:20:07,979 INFO L280 TraceCheckUtils]: 27: Hoare triple {1151#true} ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; {1151#true} is VALID [2020-07-29 03:20:07,979 INFO L280 TraceCheckUtils]: 28: Hoare triple {1151#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1151#true} is VALID [2020-07-29 03:20:07,979 INFO L280 TraceCheckUtils]: 29: Hoare triple {1151#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {1151#true} is VALID [2020-07-29 03:20:07,980 INFO L280 TraceCheckUtils]: 30: Hoare triple {1151#true} assume ~r1~0 >= 7; {1153#(< 6 ~r1~0)} is VALID [2020-07-29 03:20:07,981 INFO L280 TraceCheckUtils]: 31: Hoare triple {1153#(< 6 ~r1~0)} assume ~r1~0 < 7;check_~tmp~1 := 1; {1152#false} is VALID [2020-07-29 03:20:07,981 INFO L280 TraceCheckUtils]: 32: Hoare triple {1152#false} check_#res := check_~tmp~1; {1152#false} is VALID [2020-07-29 03:20:07,982 INFO L280 TraceCheckUtils]: 33: Hoare triple {1152#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1152#false} is VALID [2020-07-29 03:20:07,982 INFO L280 TraceCheckUtils]: 34: Hoare triple {1152#false} assume !(0 == assert_~arg % 256); {1152#false} is VALID [2020-07-29 03:20:07,982 INFO L280 TraceCheckUtils]: 35: Hoare triple {1152#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1152#false} is VALID [2020-07-29 03:20:07,983 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:20:07,984 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945570019] [2020-07-29 03:20:07,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:07,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:07,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081361658] [2020-07-29 03:20:07,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:20:07,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:07,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:20:07,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:20:07,985 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand 3 states. [2020-07-29 03:20:08,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:08,281 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2020-07-29 03:20:08,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 03:20:08,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:08,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:08,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2020-07-29 03:20:08,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2020-07-29 03:20:08,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2020-07-29 03:20:08,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2020-07-29 03:20:08,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2020-07-29 03:20:08,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2020-07-29 03:20:08,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:08,338 INFO L688 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2020-07-29 03:20:08,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2020-07-29 03:20:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2020-07-29 03:20:08,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:20:08,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states and 251 transitions. Second operand 182 states. [2020-07-29 03:20:08,347 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states and 251 transitions. Second operand 182 states. [2020-07-29 03:20:08,347 INFO L87 Difference]: Start difference. First operand 182 states and 251 transitions. Second operand 182 states. [2020-07-29 03:20:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:08,353 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2020-07-29 03:20:08,353 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2020-07-29 03:20:08,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:08,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:08,354 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 182 states and 251 transitions. [2020-07-29 03:20:08,354 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 182 states and 251 transitions. [2020-07-29 03:20:08,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:08,360 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2020-07-29 03:20:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 251 transitions. [2020-07-29 03:20:08,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:20:08,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:20:08,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:20:08,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:20:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-29 03:20:08,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2020-07-29 03:20:08,368 INFO L711 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2020-07-29 03:20:08,368 INFO L591 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2020-07-29 03:20:08,368 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:20:08,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2020-07-29 03:20:08,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2020-07-29 03:20:08,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:08,369 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:08,371 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, 1] [2020-07-29 03:20:08,371 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, 1, 1] [2020-07-29 03:20:08,371 INFO L794 eck$LassoCheckResult]: Stem: 1449#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 1353#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 1354#L307 assume 0 == ~r1~0; 1361#L308 assume ~id1~0 >= 0; 1418#L309 assume 0 == ~st1~0; 1351#L310 assume ~send1~0 == ~id1~0; 1352#L311 assume 0 == ~mode1~0 % 256; 1398#L312 assume ~id2~0 >= 0; 1399#L313 assume 0 == ~st2~0; 1442#L314 assume ~send2~0 == ~id2~0; 1384#L315 assume 0 == ~mode2~0 % 256; 1385#L316 assume ~id3~0 >= 0; 1424#L317 assume 0 == ~st3~0; 1359#L318 assume ~send3~0 == ~id3~0; 1360#L319 assume 0 == ~mode3~0 % 256; 1417#L320 assume ~id4~0 >= 0; 1346#L321 assume 0 == ~st4~0; 1347#L322 assume ~send4~0 == ~id4~0; 1396#L323 assume 0 == ~mode4~0 % 256; 1397#L324 assume ~id5~0 >= 0; 1440#L325 assume 0 == ~st5~0; 1382#L326 assume ~send5~0 == ~id5~0; 1383#L327 assume 0 == ~mode5~0 % 256; 1423#L328 assume ~id6~0 >= 0; 1357#L329 assume 0 == ~st6~0; 1358#L330 assume ~send6~0 == ~id6~0; 1416#L331 assume 0 == ~mode6~0 % 256; 1344#L332 assume ~id7~0 >= 0; 1345#L333 assume 0 == ~st7~0; 1392#L334 assume ~send7~0 == ~id7~0; 1393#L335 assume 0 == ~mode7~0 % 256; 1439#L336 assume ~id1~0 != ~id2~0; 1380#L337 assume ~id1~0 != ~id3~0; 1381#L338 assume ~id1~0 != ~id4~0; 1422#L339 assume ~id1~0 != ~id5~0; 1355#L340 assume ~id1~0 != ~id6~0; 1356#L341 assume ~id1~0 != ~id7~0; 1415#L342 assume ~id2~0 != ~id3~0; 1340#L343 assume ~id2~0 != ~id4~0; 1341#L344 assume ~id2~0 != ~id5~0; 1390#L345 assume ~id2~0 != ~id6~0; 1391#L346 assume ~id2~0 != ~id7~0; 1437#L347 assume ~id3~0 != ~id4~0; 1377#L348 assume ~id3~0 != ~id5~0; 1378#L349 assume ~id3~0 != ~id6~0; 1420#L350 assume ~id3~0 != ~id7~0; 1373#L351 assume ~id4~0 != ~id5~0; 1374#L352 assume ~id4~0 != ~id6~0; 1414#L353 assume ~id4~0 != ~id7~0; 1338#L354 assume ~id5~0 != ~id6~0; 1339#L355 assume ~id5~0 != ~id7~0; 1389#L356 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 1362#L307-1 init_#res := init_~tmp~0; 1363#L508 main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; 1364#L67 assume !(0 == assume_abort_if_not_~cond); 1408#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; 1452#L592-2 [2020-07-29 03:20:08,371 INFO L796 eck$LassoCheckResult]: Loop: 1452#L592-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1514#L130 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 1426#L134 assume !(node1_~m1~0 != ~nomsg~0); 1431#L134-1 ~mode1~0 := 0; 1458#L130-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1510#L156 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1508#L159 assume !(node2_~m2~0 != ~nomsg~0); 1506#L159-1 ~mode2~0 := 0; 1504#L156-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1503#L181 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1456#L184 assume !(node3_~m3~0 != ~nomsg~0); 1401#L184-1 ~mode3~0 := 0; 1498#L181-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1496#L206 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1494#L209 assume !(node4_~m4~0 != ~nomsg~0); 1492#L209-1 ~mode4~0 := 0; 1489#L206-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1488#L231 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1485#L234 assume !(node5_~m5~0 != ~nomsg~0); 1483#L234-1 ~mode5~0 := 0; 1481#L231-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1480#L256 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1477#L259 assume !(node6_~m6~0 != ~nomsg~0); 1475#L259-1 ~mode6~0 := 0; 1473#L256-2 havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 1472#L281 assume !(0 != ~mode7~0 % 256); 1468#L294 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; 1466#L294-2 ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; 1465#L281-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1464#L516 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 1463#L517 assume !(~r1~0 >= 7); 1450#L520 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 1451#L521 assume ~r1~0 < 7;check_~tmp~1 := 1; 1490#L516-1 check_#res := check_~tmp~1; 1517#L536 main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1516#L628 assume !(0 == assert_~arg % 256); 1515#L623 main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; 1452#L592-2 [2020-07-29 03:20:08,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2020-07-29 03:20:08,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:08,372 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788075399] [2020-07-29 03:20:08,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:08,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:08,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:08,433 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:08,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:08,434 INFO L82 PathProgramCache]: Analyzing trace with hash 134833435, now seen corresponding path program 1 times [2020-07-29 03:20:08,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:08,435 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503423179] [2020-07-29 03:20:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:08,448 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:20:08,460 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:20:08,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:20:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1517901398, now seen corresponding path program 1 times [2020-07-29 03:20:08,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:20:08,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727300312] [2020-07-29 03:20:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:20:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:08,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {1889#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; {1889#true} is VALID [2020-07-29 03:20:08,588 INFO L280 TraceCheckUtils]: 1: Hoare triple {1889#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1889#true} is VALID [2020-07-29 03:20:08,589 INFO L280 TraceCheckUtils]: 2: Hoare triple {1889#true} assume 0 == ~r1~0; {1889#true} is VALID [2020-07-29 03:20:08,589 INFO L280 TraceCheckUtils]: 3: Hoare triple {1889#true} assume ~id1~0 >= 0; {1889#true} is VALID [2020-07-29 03:20:08,589 INFO L280 TraceCheckUtils]: 4: Hoare triple {1889#true} assume 0 == ~st1~0; {1889#true} is VALID [2020-07-29 03:20:08,589 INFO L280 TraceCheckUtils]: 5: Hoare triple {1889#true} assume ~send1~0 == ~id1~0; {1889#true} is VALID [2020-07-29 03:20:08,590 INFO L280 TraceCheckUtils]: 6: Hoare triple {1889#true} assume 0 == ~mode1~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,591 INFO L280 TraceCheckUtils]: 7: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,591 INFO L280 TraceCheckUtils]: 8: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,602 INFO L280 TraceCheckUtils]: 9: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,603 INFO L280 TraceCheckUtils]: 11: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,604 INFO L280 TraceCheckUtils]: 12: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,605 INFO L280 TraceCheckUtils]: 14: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,607 INFO L280 TraceCheckUtils]: 16: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,610 INFO L280 TraceCheckUtils]: 17: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,610 INFO L280 TraceCheckUtils]: 18: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,611 INFO L280 TraceCheckUtils]: 20: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,612 INFO L280 TraceCheckUtils]: 22: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 >= 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,613 INFO L280 TraceCheckUtils]: 24: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send6~0 == ~id6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,614 INFO L280 TraceCheckUtils]: 26: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode6~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,615 INFO L280 TraceCheckUtils]: 27: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id7~0 >= 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,615 INFO L280 TraceCheckUtils]: 28: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,616 INFO L280 TraceCheckUtils]: 29: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send7~0 == ~id7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,616 INFO L280 TraceCheckUtils]: 30: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode7~0 % 256; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,617 INFO L280 TraceCheckUtils]: 31: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,617 INFO L280 TraceCheckUtils]: 32: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,618 INFO L280 TraceCheckUtils]: 33: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,618 INFO L280 TraceCheckUtils]: 34: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,619 INFO L280 TraceCheckUtils]: 35: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,620 INFO L280 TraceCheckUtils]: 36: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,621 INFO L280 TraceCheckUtils]: 37: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,622 INFO L280 TraceCheckUtils]: 38: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,622 INFO L280 TraceCheckUtils]: 39: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,623 INFO L280 TraceCheckUtils]: 40: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,623 INFO L280 TraceCheckUtils]: 41: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,624 INFO L280 TraceCheckUtils]: 42: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,624 INFO L280 TraceCheckUtils]: 43: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,625 INFO L280 TraceCheckUtils]: 44: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,625 INFO L280 TraceCheckUtils]: 45: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,626 INFO L280 TraceCheckUtils]: 46: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,626 INFO L280 TraceCheckUtils]: 47: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,627 INFO L280 TraceCheckUtils]: 48: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,627 INFO L280 TraceCheckUtils]: 49: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id6~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,628 INFO L280 TraceCheckUtils]: 50: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id7~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,628 INFO L280 TraceCheckUtils]: 51: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,629 INFO L280 TraceCheckUtils]: 52: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,629 INFO L280 TraceCheckUtils]: 53: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,630 INFO L280 TraceCheckUtils]: 54: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,630 INFO L280 TraceCheckUtils]: 55: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,631 INFO L280 TraceCheckUtils]: 56: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:20:08,632 INFO L280 TraceCheckUtils]: 57: Hoare triple {1891#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,632 INFO L280 TraceCheckUtils]: 58: Hoare triple {1890#false} assume !(node1_~m1~0 != ~nomsg~0); {1890#false} is VALID [2020-07-29 03:20:08,632 INFO L280 TraceCheckUtils]: 59: Hoare triple {1890#false} ~mode1~0 := 0; {1890#false} is VALID [2020-07-29 03:20:08,633 INFO L280 TraceCheckUtils]: 60: Hoare triple {1890#false} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,633 INFO L280 TraceCheckUtils]: 61: Hoare triple {1890#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,633 INFO L280 TraceCheckUtils]: 62: Hoare triple {1890#false} assume !(node2_~m2~0 != ~nomsg~0); {1890#false} is VALID [2020-07-29 03:20:08,633 INFO L280 TraceCheckUtils]: 63: Hoare triple {1890#false} ~mode2~0 := 0; {1890#false} is VALID [2020-07-29 03:20:08,633 INFO L280 TraceCheckUtils]: 64: Hoare triple {1890#false} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,634 INFO L280 TraceCheckUtils]: 65: Hoare triple {1890#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,634 INFO L280 TraceCheckUtils]: 66: Hoare triple {1890#false} assume !(node3_~m3~0 != ~nomsg~0); {1890#false} is VALID [2020-07-29 03:20:08,634 INFO L280 TraceCheckUtils]: 67: Hoare triple {1890#false} ~mode3~0 := 0; {1890#false} is VALID [2020-07-29 03:20:08,634 INFO L280 TraceCheckUtils]: 68: Hoare triple {1890#false} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,634 INFO L280 TraceCheckUtils]: 69: Hoare triple {1890#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,635 INFO L280 TraceCheckUtils]: 70: Hoare triple {1890#false} assume !(node4_~m4~0 != ~nomsg~0); {1890#false} is VALID [2020-07-29 03:20:08,635 INFO L280 TraceCheckUtils]: 71: Hoare triple {1890#false} ~mode4~0 := 0; {1890#false} is VALID [2020-07-29 03:20:08,635 INFO L280 TraceCheckUtils]: 72: Hoare triple {1890#false} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,636 INFO L280 TraceCheckUtils]: 73: Hoare triple {1890#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,637 INFO L280 TraceCheckUtils]: 74: Hoare triple {1890#false} assume !(node5_~m5~0 != ~nomsg~0); {1890#false} is VALID [2020-07-29 03:20:08,637 INFO L280 TraceCheckUtils]: 75: Hoare triple {1890#false} ~mode5~0 := 0; {1890#false} is VALID [2020-07-29 03:20:08,637 INFO L280 TraceCheckUtils]: 76: Hoare triple {1890#false} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,637 INFO L280 TraceCheckUtils]: 77: Hoare triple {1890#false} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,638 INFO L280 TraceCheckUtils]: 78: Hoare triple {1890#false} assume !(node6_~m6~0 != ~nomsg~0); {1890#false} is VALID [2020-07-29 03:20:08,638 INFO L280 TraceCheckUtils]: 79: Hoare triple {1890#false} ~mode6~0 := 0; {1890#false} is VALID [2020-07-29 03:20:08,638 INFO L280 TraceCheckUtils]: 80: Hoare triple {1890#false} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {1890#false} is VALID [2020-07-29 03:20:08,638 INFO L280 TraceCheckUtils]: 81: Hoare triple {1890#false} assume !(0 != ~mode7~0 % 256); {1890#false} is VALID [2020-07-29 03:20:08,638 INFO L280 TraceCheckUtils]: 82: Hoare triple {1890#false} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; {1890#false} is VALID [2020-07-29 03:20:08,639 INFO L280 TraceCheckUtils]: 83: Hoare triple {1890#false} ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; {1890#false} is VALID [2020-07-29 03:20:08,639 INFO L280 TraceCheckUtils]: 84: Hoare triple {1890#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1890#false} is VALID [2020-07-29 03:20:08,639 INFO L280 TraceCheckUtils]: 85: Hoare triple {1890#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {1890#false} is VALID [2020-07-29 03:20:08,639 INFO L280 TraceCheckUtils]: 86: Hoare triple {1890#false} assume !(~r1~0 >= 7); {1890#false} is VALID [2020-07-29 03:20:08,640 INFO L280 TraceCheckUtils]: 87: Hoare triple {1890#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; {1890#false} is VALID [2020-07-29 03:20:08,640 INFO L280 TraceCheckUtils]: 88: Hoare triple {1890#false} assume ~r1~0 < 7;check_~tmp~1 := 1; {1890#false} is VALID [2020-07-29 03:20:08,640 INFO L280 TraceCheckUtils]: 89: Hoare triple {1890#false} check_#res := check_~tmp~1; {1890#false} is VALID [2020-07-29 03:20:08,641 INFO L280 TraceCheckUtils]: 90: Hoare triple {1890#false} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1890#false} is VALID [2020-07-29 03:20:08,642 INFO L280 TraceCheckUtils]: 91: Hoare triple {1890#false} assume !(0 == assert_~arg % 256); {1890#false} is VALID [2020-07-29 03:20:08,642 INFO L280 TraceCheckUtils]: 92: Hoare triple {1890#false} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1890#false} is VALID [2020-07-29 03:20:08,661 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:20:08,662 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727300312] [2020-07-29 03:20:08,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:20:08,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:20:08,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765548552] [2020-07-29 03:20:09,321 WARN L193 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 182 [2020-07-29 03:20:10,090 WARN L193 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 159 [2020-07-29 03:20:10,108 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:20:10,109 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:20:10,109 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:20:10,109 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:20:10,110 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:20:10,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:10,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:20:10,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:20:10,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2020-07-29 03:20:10,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:20:10,111 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:20:10,207 INFO L141 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:20:10,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:20:10,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,258 INFO L141 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:20:10,266 INFO L141 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:20:10,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,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:20:10,289 INFO L141 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:20:10,294 INFO L141 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:20:10,302 INFO L141 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:20:10,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,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:20:10,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:20:10,320 INFO L141 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:20:10,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,340 INFO L141 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:20:10,348 INFO L141 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:20:10,356 INFO L141 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:20:10,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:20:10,365 INFO L141 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:20:10,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:20:10,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:20:10,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:20:10,384 INFO L141 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:20:10,387 INFO L141 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:20:10,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:10,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:20:10,403 INFO L141 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:20:10,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:20:10,416 INFO L141 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:20:10,613 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-07-29 03:20:10,616 INFO L141 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:20:10,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:11,706 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-07-29 03:20:14,445 WARN L193 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2020-07-29 03:20:14,623 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:20:14,624 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:20:14,640 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:20:14,640 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:20:14,682 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:20:14,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:20:14,834 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:20:14,836 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:20:14,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:20:14,836 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:20:14,836 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:20:14,836 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:20:14,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:14,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:20:14,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:20:14,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2020-07-29 03:20:14,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:20:14,837 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:20:14,907 INFO L141 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:20:14,913 INFO L141 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:20:14,917 INFO L141 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:20:14,921 INFO L141 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:20:14,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,956 INFO L141 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:20:14,960 INFO L141 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:20:14,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,976 INFO L141 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:20:14,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:14,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,002 INFO L141 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:20:15,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,015 INFO L141 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:20:15,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,025 INFO L141 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:20:15,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,035 INFO L141 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:20:15,040 INFO L141 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:20:15,044 INFO L141 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:20:15,047 INFO L141 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:20:15,051 INFO L141 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:20:15,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,063 INFO L141 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:20:15,070 INFO L141 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:20:15,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:20:15,078 INFO L141 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:20:15,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:20:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,293 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2020-07-29 03:20:15,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:15,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:20:16,326 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-07-29 03:20:19,080 WARN L193 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 122 DAG size of output: 118 [2020-07-29 03:20:19,231 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:20:19,235 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:20:19,240 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:20:19,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,251 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:20:19,276 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:20:19,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,280 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:19,280 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:19,283 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:20:19,307 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:20:19,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,310 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,310 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,313 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:20:19,339 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:20:19,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,341 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:20:19,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,345 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:20:19,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,349 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:20:19,372 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:20:19,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:19,381 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:19,385 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:20:19,409 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:20:19,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,415 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:20:19,439 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:20:19,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,442 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:19,443 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:19,445 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:20:19,468 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:20:19,469 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,470 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,470 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,471 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:19,472 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:19,475 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:20:19,497 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:20:19,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,502 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:20:19,525 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:20:19,526 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,526 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,526 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,527 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,528 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:20:19,556 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:20:19,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:19,559 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:19,563 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) [2020-07-29 03:20:19,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:19,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,622 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,623 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,624 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:20:19,646 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:20:19,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,654 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:20:19,676 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:20:19,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,678 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,680 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:20:19,705 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:20:19,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:20:19,708 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:20:19,712 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:20:19,735 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:20:19,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,737 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:20:19,768 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:20:19,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,772 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,774 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:20:19,802 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:20:19,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:20:19,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:20:19,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:20:19,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:20:19,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:20:19,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:20:19,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:20:19,807 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:20:19,815 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:20:19,816 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:20:19,820 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:20:19,821 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:20:19,821 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:20:19,821 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 27 Supporting invariants [] [2020-07-29 03:20:19,874 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:20:19,885 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~0 := 0;" "havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0 != ~nomsg~0);" "~mode6~0 := 0;" "havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0;" "assume !(0 != ~mode7~0 % 256);" "assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0;" "~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1;" "assume !(~r1~0 >= 7);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0;" "assume ~r1~0 < 7;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;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~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38;" [2020-07-29 03:20:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:19,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:20:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:19,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:20:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:20,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:20:20,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {1892#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; {1892#unseeded} is VALID [2020-07-29 03:20:20,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {1892#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~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~ret36, main_#t~ret37, main_#t~post38, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id2~0 := main_#t~nondet12;havoc main_#t~nondet12;~st2~0 := main_#t~nondet13;havoc main_#t~nondet13;~send2~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode2~0 := main_#t~nondet15;havoc main_#t~nondet15;~id3~0 := main_#t~nondet16;havoc main_#t~nondet16;~st3~0 := main_#t~nondet17;havoc main_#t~nondet17;~send3~0 := main_#t~nondet18;havoc main_#t~nondet18;~mode3~0 := main_#t~nondet19;havoc main_#t~nondet19;~id4~0 := main_#t~nondet20;havoc main_#t~nondet20;~st4~0 := main_#t~nondet21;havoc main_#t~nondet21;~send4~0 := main_#t~nondet22;havoc main_#t~nondet22;~mode4~0 := main_#t~nondet23;havoc main_#t~nondet23;~id5~0 := main_#t~nondet24;havoc main_#t~nondet24;~st5~0 := main_#t~nondet25;havoc main_#t~nondet25;~send5~0 := main_#t~nondet26;havoc main_#t~nondet26;~mode5~0 := main_#t~nondet27;havoc main_#t~nondet27;~id6~0 := main_#t~nondet28;havoc main_#t~nondet28;~st6~0 := main_#t~nondet29;havoc main_#t~nondet29;~send6~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode6~0 := main_#t~nondet31;havoc main_#t~nondet31;~id7~0 := main_#t~nondet32;havoc main_#t~nondet32;~st7~0 := main_#t~nondet33;havoc main_#t~nondet33;~send7~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode7~0 := main_#t~nondet35;havoc main_#t~nondet35;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {1892#unseeded} assume 0 == ~r1~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {1892#unseeded} assume ~id1~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,060 INFO L280 TraceCheckUtils]: 4: Hoare triple {1892#unseeded} assume 0 == ~st1~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,061 INFO L280 TraceCheckUtils]: 5: Hoare triple {1892#unseeded} assume ~send1~0 == ~id1~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,061 INFO L280 TraceCheckUtils]: 6: Hoare triple {1892#unseeded} assume 0 == ~mode1~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,062 INFO L280 TraceCheckUtils]: 7: Hoare triple {1892#unseeded} assume ~id2~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {1892#unseeded} assume 0 == ~st2~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,063 INFO L280 TraceCheckUtils]: 9: Hoare triple {1892#unseeded} assume ~send2~0 == ~id2~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,064 INFO L280 TraceCheckUtils]: 10: Hoare triple {1892#unseeded} assume 0 == ~mode2~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,064 INFO L280 TraceCheckUtils]: 11: Hoare triple {1892#unseeded} assume ~id3~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,065 INFO L280 TraceCheckUtils]: 12: Hoare triple {1892#unseeded} assume 0 == ~st3~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,065 INFO L280 TraceCheckUtils]: 13: Hoare triple {1892#unseeded} assume ~send3~0 == ~id3~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,066 INFO L280 TraceCheckUtils]: 14: Hoare triple {1892#unseeded} assume 0 == ~mode3~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,066 INFO L280 TraceCheckUtils]: 15: Hoare triple {1892#unseeded} assume ~id4~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,067 INFO L280 TraceCheckUtils]: 16: Hoare triple {1892#unseeded} assume 0 == ~st4~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,067 INFO L280 TraceCheckUtils]: 17: Hoare triple {1892#unseeded} assume ~send4~0 == ~id4~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,068 INFO L280 TraceCheckUtils]: 18: Hoare triple {1892#unseeded} assume 0 == ~mode4~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,068 INFO L280 TraceCheckUtils]: 19: Hoare triple {1892#unseeded} assume ~id5~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,069 INFO L280 TraceCheckUtils]: 20: Hoare triple {1892#unseeded} assume 0 == ~st5~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,069 INFO L280 TraceCheckUtils]: 21: Hoare triple {1892#unseeded} assume ~send5~0 == ~id5~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,070 INFO L280 TraceCheckUtils]: 22: Hoare triple {1892#unseeded} assume 0 == ~mode5~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,071 INFO L280 TraceCheckUtils]: 23: Hoare triple {1892#unseeded} assume ~id6~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,071 INFO L280 TraceCheckUtils]: 24: Hoare triple {1892#unseeded} assume 0 == ~st6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {1892#unseeded} assume ~send6~0 == ~id6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,072 INFO L280 TraceCheckUtils]: 26: Hoare triple {1892#unseeded} assume 0 == ~mode6~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,073 INFO L280 TraceCheckUtils]: 27: Hoare triple {1892#unseeded} assume ~id7~0 >= 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,073 INFO L280 TraceCheckUtils]: 28: Hoare triple {1892#unseeded} assume 0 == ~st7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,074 INFO L280 TraceCheckUtils]: 29: Hoare triple {1892#unseeded} assume ~send7~0 == ~id7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,074 INFO L280 TraceCheckUtils]: 30: Hoare triple {1892#unseeded} assume 0 == ~mode7~0 % 256; {1892#unseeded} is VALID [2020-07-29 03:20:20,075 INFO L280 TraceCheckUtils]: 31: Hoare triple {1892#unseeded} assume ~id1~0 != ~id2~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,075 INFO L280 TraceCheckUtils]: 32: Hoare triple {1892#unseeded} assume ~id1~0 != ~id3~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,076 INFO L280 TraceCheckUtils]: 33: Hoare triple {1892#unseeded} assume ~id1~0 != ~id4~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,076 INFO L280 TraceCheckUtils]: 34: Hoare triple {1892#unseeded} assume ~id1~0 != ~id5~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,077 INFO L280 TraceCheckUtils]: 35: Hoare triple {1892#unseeded} assume ~id1~0 != ~id6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,077 INFO L280 TraceCheckUtils]: 36: Hoare triple {1892#unseeded} assume ~id1~0 != ~id7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,078 INFO L280 TraceCheckUtils]: 37: Hoare triple {1892#unseeded} assume ~id2~0 != ~id3~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,078 INFO L280 TraceCheckUtils]: 38: Hoare triple {1892#unseeded} assume ~id2~0 != ~id4~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,079 INFO L280 TraceCheckUtils]: 39: Hoare triple {1892#unseeded} assume ~id2~0 != ~id5~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,079 INFO L280 TraceCheckUtils]: 40: Hoare triple {1892#unseeded} assume ~id2~0 != ~id6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,080 INFO L280 TraceCheckUtils]: 41: Hoare triple {1892#unseeded} assume ~id2~0 != ~id7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,081 INFO L280 TraceCheckUtils]: 42: Hoare triple {1892#unseeded} assume ~id3~0 != ~id4~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,081 INFO L280 TraceCheckUtils]: 43: Hoare triple {1892#unseeded} assume ~id3~0 != ~id5~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,082 INFO L280 TraceCheckUtils]: 44: Hoare triple {1892#unseeded} assume ~id3~0 != ~id6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,082 INFO L280 TraceCheckUtils]: 45: Hoare triple {1892#unseeded} assume ~id3~0 != ~id7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,083 INFO L280 TraceCheckUtils]: 46: Hoare triple {1892#unseeded} assume ~id4~0 != ~id5~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,083 INFO L280 TraceCheckUtils]: 47: Hoare triple {1892#unseeded} assume ~id4~0 != ~id6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,084 INFO L280 TraceCheckUtils]: 48: Hoare triple {1892#unseeded} assume ~id4~0 != ~id7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,084 INFO L280 TraceCheckUtils]: 49: Hoare triple {1892#unseeded} assume ~id5~0 != ~id6~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,085 INFO L280 TraceCheckUtils]: 50: Hoare triple {1892#unseeded} assume ~id5~0 != ~id7~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,085 INFO L280 TraceCheckUtils]: 51: Hoare triple {1892#unseeded} assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; {1892#unseeded} is VALID [2020-07-29 03:20:20,086 INFO L280 TraceCheckUtils]: 52: Hoare triple {1892#unseeded} init_#res := init_~tmp~0; {1892#unseeded} is VALID [2020-07-29 03:20:20,086 INFO L280 TraceCheckUtils]: 53: Hoare triple {1892#unseeded} main_#t~ret36 := init_#res;main_~i2~0 := main_#t~ret36;havoc main_#t~ret36;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; {1892#unseeded} is VALID [2020-07-29 03:20:20,087 INFO L280 TraceCheckUtils]: 54: Hoare triple {1892#unseeded} assume !(0 == assume_abort_if_not_~cond); {1892#unseeded} is VALID [2020-07-29 03:20:20,087 INFO L280 TraceCheckUtils]: 55: Hoare triple {1892#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0 := 0; {1892#unseeded} is VALID [2020-07-29 03:20:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:20,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:20:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:20:20,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:20:20,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {1895#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 27))} assume !!(main_~i2~0 < 14);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,225 INFO L280 TraceCheckUtils]: 3: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,226 INFO L280 TraceCheckUtils]: 4: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,226 INFO L280 TraceCheckUtils]: 5: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,227 INFO L280 TraceCheckUtils]: 6: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,229 INFO L280 TraceCheckUtils]: 9: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,230 INFO L280 TraceCheckUtils]: 10: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,231 INFO L280 TraceCheckUtils]: 11: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,231 INFO L280 TraceCheckUtils]: 12: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,232 INFO L280 TraceCheckUtils]: 13: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,233 INFO L280 TraceCheckUtils]: 14: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,234 INFO L280 TraceCheckUtils]: 15: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,235 INFO L280 TraceCheckUtils]: 16: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,235 INFO L280 TraceCheckUtils]: 17: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,236 INFO L280 TraceCheckUtils]: 18: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,237 INFO L280 TraceCheckUtils]: 19: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,238 INFO L280 TraceCheckUtils]: 20: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,238 INFO L280 TraceCheckUtils]: 21: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,239 INFO L280 TraceCheckUtils]: 22: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node6_~m6~0 != ~nomsg~0); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,240 INFO L280 TraceCheckUtils]: 23: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode6~0 := 0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,241 INFO L280 TraceCheckUtils]: 24: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node7_#t~ite6, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,241 INFO L280 TraceCheckUtils]: 25: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode7~0 % 256); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,242 INFO L280 TraceCheckUtils]: 26: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite6 := ~send7~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,243 INFO L280 TraceCheckUtils]: 27: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p7_new~0 := (if node7_#t~ite6 % 256 <= 127 then node7_#t~ite6 % 256 else node7_#t~ite6 % 256 - 256);havoc node7_#t~ite6;~mode7~0 := 1; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,244 INFO L280 TraceCheckUtils]: 28: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,245 INFO L280 TraceCheckUtils]: 29: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,246 INFO L280 TraceCheckUtils]: 30: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(~r1~0 >= 7); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,246 INFO L280 TraceCheckUtils]: 31: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,247 INFO L280 TraceCheckUtils]: 32: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 7;check_~tmp~1 := 1; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,248 INFO L280 TraceCheckUtils]: 33: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,249 INFO L280 TraceCheckUtils]: 34: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret37 := check_#res;main_~c1~0 := main_#t~ret37;havoc main_#t~ret37;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,250 INFO L280 TraceCheckUtils]: 35: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:20:20,251 INFO L280 TraceCheckUtils]: 36: Hoare triple {2075#(and (< ULTIMATE.start_main_~i2~0 14) (<= 27 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post38 := main_~i2~0;main_~i2~0 := 1 + main_#t~post38;havoc main_#t~post38; {1905#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 27))) unseeded)} is VALID [2020-07-29 03:20:20,251 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:20:20,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:20,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:20,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,308 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:20:20,308 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70 Second operand 3 states. [2020-07-29 03:20:20,675 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70. Second operand 3 states. Result 307 states and 446 transitions. Complement of second has 4 states. [2020-07-29 03:20:20,675 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:20:20,675 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:20:20,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. cyclomatic complexity: 70 [2020-07-29 03:20:20,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:20,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:20,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:20:20,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:20:20,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:20:20,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:20:20,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 446 transitions. [2020-07-29 03:20:20,690 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:20,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:20:20,694 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 182 states and 251 transitions. cyclomatic complexity: 70 [2020-07-29 03:20:20,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 126 examples of accepted words. [2020-07-29 03:20:20,842 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:20:20,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:20:20,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:20:20,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 307 states and 446 transitions. cyclomatic complexity: 140 [2020-07-29 03:20:20,847 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 307 states and 446 transitions. cyclomatic complexity: 140 [2020-07-29 03:20:20,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:20:20,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:20:20,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:20,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:20,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 307 letters. Loop has 307 letters. [2020-07-29 03:20:20,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 307 letters. Loop has 307 letters. [2020-07-29 03:20:20,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 307 letters. Loop has 307 letters. [2020-07-29 03:20:20,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 182 letters. Loop has 182 letters. [2020-07-29 03:20:20,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 182 letters. Loop has 182 letters. [2020-07-29 03:20:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 182 letters. Loop has 182 letters. [2020-07-29 03:20:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:20:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:20:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:20:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 107 letters. Loop has 37 letters. [2020-07-29 03:20:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 107 letters. Loop has 37 letters. [2020-07-29 03:20:20,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 107 letters. Loop has 37 letters. [2020-07-29 03:20:20,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 108 letters. Loop has 37 letters. [2020-07-29 03:20:20,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 108 letters. Loop has 37 letters. [2020-07-29 03:20:20,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 108 letters. Loop has 37 letters. [2020-07-29 03:20:20,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 117 letters. Loop has 39 letters. [2020-07-29 03:20:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 117 letters. Loop has 39 letters. [2020-07-29 03:20:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 117 letters. Loop has 39 letters. [2020-07-29 03:20:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 116 letters. Loop has 37 letters. [2020-07-29 03:20:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 37 letters. [2020-07-29 03:20:20,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 116 letters. Loop has 37 letters. [2020-07-29 03:20:20,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 120 letters. Loop has 38 letters. [2020-07-29 03:20:20,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 120 letters. Loop has 38 letters. [2020-07-29 03:20:20,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 120 letters. Loop has 38 letters. [2020-07-29 03:20:20,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 120 letters. Loop has 37 letters. [2020-07-29 03:20:20,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 120 letters. Loop has 37 letters. [2020-07-29 03:20:20,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 120 letters. Loop has 37 letters. [2020-07-29 03:20:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 121 letters. Loop has 39 letters. [2020-07-29 03:20:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 121 letters. Loop has 39 letters. [2020-07-29 03:20:20,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 121 letters. Loop has 39 letters. [2020-07-29 03:20:20,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 109 letters. Loop has 37 letters. [2020-07-29 03:20:20,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 109 letters. Loop has 37 letters. [2020-07-29 03:20:20,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 109 letters. Loop has 37 letters. [2020-07-29 03:20:20,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 122 letters. Loop has 37 letters. [2020-07-29 03:20:20,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 122 letters. Loop has 37 letters. [2020-07-29 03:20:20,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 122 letters. Loop has 37 letters. [2020-07-29 03:20:20,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 123 letters. Loop has 37 letters. [2020-07-29 03:20:20,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 123 letters. Loop has 37 letters. [2020-07-29 03:20:20,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 123 letters. Loop has 37 letters. [2020-07-29 03:20:20,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 89 letters. Loop has 37 letters. [2020-07-29 03:20:20,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 37 letters. [2020-07-29 03:20:20,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 89 letters. Loop has 37 letters. [2020-07-29 03:20:20,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 90 letters. Loop has 37 letters. [2020-07-29 03:20:20,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 37 letters. [2020-07-29 03:20:20,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 90 letters. Loop has 37 letters. [2020-07-29 03:20:20,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 100 letters. Loop has 37 letters. [2020-07-29 03:20:20,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 100 letters. Loop has 37 letters. [2020-07-29 03:20:20,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 100 letters. Loop has 37 letters. [2020-07-29 03:20:20,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 101 letters. Loop has 37 letters. [2020-07-29 03:20:20,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 101 letters. Loop has 37 letters. [2020-07-29 03:20:20,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 101 letters. Loop has 37 letters. [2020-07-29 03:20:20,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 99 letters. Loop has 37 letters. [2020-07-29 03:20:20,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 37 letters. [2020-07-29 03:20:20,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 99 letters. Loop has 37 letters. [2020-07-29 03:20:20,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 104 letters. Loop has 37 letters. [2020-07-29 03:20:20,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 104 letters. Loop has 37 letters. [2020-07-29 03:20:20,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 104 letters. Loop has 37 letters. [2020-07-29 03:20:20,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 105 letters. Loop has 37 letters. [2020-07-29 03:20:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 105 letters. Loop has 37 letters. [2020-07-29 03:20:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 105 letters. Loop has 37 letters. [2020-07-29 03:20:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 103 letters. Loop has 37 letters. [2020-07-29 03:20:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 103 letters. Loop has 37 letters. [2020-07-29 03:20:20,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 103 letters. Loop has 37 letters. [2020-07-29 03:20:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 113 letters. Loop has 39 letters. [2020-07-29 03:20:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 113 letters. Loop has 39 letters. [2020-07-29 03:20:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 113 letters. Loop has 39 letters. [2020-07-29 03:20:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 112 letters. Loop has 37 letters. [2020-07-29 03:20:20,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 112 letters. Loop has 37 letters. [2020-07-29 03:20:20,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 112 letters. Loop has 37 letters. [2020-07-29 03:20:20,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 116 letters. Loop has 38 letters. [2020-07-29 03:20:20,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 38 letters. [2020-07-29 03:20:20,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 116 letters. Loop has 38 letters. [2020-07-29 03:20:20,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 95 letters. Loop has 37 letters. [2020-07-29 03:20:20,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 95 letters. Loop has 37 letters. [2020-07-29 03:20:20,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 95 letters. Loop has 37 letters. [2020-07-29 03:20:20,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 96 letters. Loop has 37 letters. [2020-07-29 03:20:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 96 letters. Loop has 37 letters. [2020-07-29 03:20:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 96 letters. Loop has 37 letters. [2020-07-29 03:20:20,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:20:20,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:20:20,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 68 letters. Loop has 39 letters. [2020-07-29 03:20:20,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:20:20,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:20:20,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:20:20,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 108 letters. Loop has 38 letters. [2020-07-29 03:20:20,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 108 letters. Loop has 38 letters. [2020-07-29 03:20:20,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 108 letters. Loop has 38 letters. [2020-07-29 03:20:20,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 108 letters. Loop has 37 letters. [2020-07-29 03:20:20,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 108 letters. Loop has 37 letters. [2020-07-29 03:20:20,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 108 letters. Loop has 37 letters. [2020-07-29 03:20:20,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 109 letters. Loop has 39 letters. [2020-07-29 03:20:20,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 109 letters. Loop has 39 letters. [2020-07-29 03:20:20,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 109 letters. Loop has 39 letters. [2020-07-29 03:20:20,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 87 letters. Loop has 37 letters. [2020-07-29 03:20:20,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 37 letters. [2020-07-29 03:20:20,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 87 letters. Loop has 37 letters. [2020-07-29 03:20:20,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 88 letters. Loop has 37 letters. [2020-07-29 03:20:20,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 37 letters. [2020-07-29 03:20:20,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 88 letters. Loop has 37 letters. [2020-07-29 03:20:20,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 112 letters. Loop has 38 letters. [2020-07-29 03:20:20,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 112 letters. Loop has 38 letters. [2020-07-29 03:20:20,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 112 letters. Loop has 38 letters. [2020-07-29 03:20:20,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 97 letters. Loop has 37 letters. [2020-07-29 03:20:20,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 97 letters. Loop has 37 letters. [2020-07-29 03:20:20,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 97 letters. Loop has 37 letters. [2020-07-29 03:20:20,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 92 letters. Loop has 37 letters. [2020-07-29 03:20:20,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 92 letters. Loop has 37 letters. [2020-07-29 03:20:20,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 92 letters. Loop has 37 letters. [2020-07-29 03:20:20,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 93 letters. Loop has 37 letters. [2020-07-29 03:20:20,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 93 letters. Loop has 37 letters. [2020-07-29 03:20:20,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 93 letters. Loop has 37 letters. [2020-07-29 03:20:20,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 121 letters. Loop has 37 letters. [2020-07-29 03:20:20,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 121 letters. Loop has 37 letters. [2020-07-29 03:20:20,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 121 letters. Loop has 37 letters. [2020-07-29 03:20:20,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 119 letters. Loop has 37 letters. [2020-07-29 03:20:20,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 119 letters. Loop has 37 letters. [2020-07-29 03:20:20,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 119 letters. Loop has 37 letters. [2020-07-29 03:20:20,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 91 letters. Loop has 37 letters. [2020-07-29 03:20:20,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 37 letters. [2020-07-29 03:20:20,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 91 letters. Loop has 37 letters. [2020-07-29 03:20:20,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 98 letters. Loop has 37 letters. [2020-07-29 03:20:20,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 98 letters. Loop has 37 letters. [2020-07-29 03:20:20,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 98 letters. Loop has 37 letters. [2020-07-29 03:20:20,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 94 letters. Loop has 37 letters. [2020-07-29 03:20:20,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 94 letters. Loop has 37 letters. [2020-07-29 03:20:20,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 94 letters. Loop has 37 letters. [2020-07-29 03:20:20,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 58 letters. Loop has 37 letters. [2020-07-29 03:20:20,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 37 letters. [2020-07-29 03:20:20,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 58 letters. Loop has 37 letters. [2020-07-29 03:20:20,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 101 letters. Loop has 39 letters. [2020-07-29 03:20:20,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 101 letters. Loop has 39 letters. [2020-07-29 03:20:20,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 101 letters. Loop has 39 letters. [2020-07-29 03:20:20,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 100 letters. Loop has 37 letters. [2020-07-29 03:20:20,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 100 letters. Loop has 37 letters. [2020-07-29 03:20:20,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 100 letters. Loop has 37 letters. [2020-07-29 03:20:20,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:20:20,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:20:20,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 67 letters. Loop has 38 letters. [2020-07-29 03:20:20,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 59 letters. Loop has 38 letters. [2020-07-29 03:20:20,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 38 letters. [2020-07-29 03:20:20,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 59 letters. Loop has 38 letters. [2020-07-29 03:20:20,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:20:20,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:20:20,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:20:20,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 60 letters. Loop has 39 letters. [2020-07-29 03:20:20,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 39 letters. [2020-07-29 03:20:20,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 60 letters. Loop has 39 letters. [2020-07-29 03:20:20,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 117 letters. Loop has 37 letters. [2020-07-29 03:20:20,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 117 letters. Loop has 37 letters. [2020-07-29 03:20:20,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 117 letters. Loop has 37 letters. [2020-07-29 03:20:20,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 118 letters. Loop has 37 letters. [2020-07-29 03:20:20,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 118 letters. Loop has 37 letters. [2020-07-29 03:20:20,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 118 letters. Loop has 37 letters. [2020-07-29 03:20:20,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 113 letters. Loop has 37 letters. [2020-07-29 03:20:20,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 113 letters. Loop has 37 letters. [2020-07-29 03:20:20,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 113 letters. Loop has 37 letters. [2020-07-29 03:20:20,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 100 letters. Loop has 38 letters. [2020-07-29 03:20:20,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 100 letters. Loop has 38 letters. [2020-07-29 03:20:20,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 100 letters. Loop has 38 letters. [2020-07-29 03:20:20,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 115 letters. Loop has 37 letters. [2020-07-29 03:20:20,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 37 letters. [2020-07-29 03:20:20,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 115 letters. Loop has 37 letters. [2020-07-29 03:20:20,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 119 letters. Loop has 37 letters. [2020-07-29 03:20:20,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 119 letters. Loop has 37 letters. [2020-07-29 03:20:20,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 119 letters. Loop has 37 letters. [2020-07-29 03:20:20,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 114 letters. Loop has 37 letters. [2020-07-29 03:20:20,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 114 letters. Loop has 37 letters. [2020-07-29 03:20:20,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 114 letters. Loop has 37 letters. [2020-07-29 03:20:20,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 107 letters. Loop has 37 letters. [2020-07-29 03:20:20,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 107 letters. Loop has 37 letters. [2020-07-29 03:20:20,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 107 letters. Loop has 37 letters. [2020-07-29 03:20:20,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 110 letters. Loop has 37 letters. [2020-07-29 03:20:20,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 110 letters. Loop has 37 letters. [2020-07-29 03:20:20,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 110 letters. Loop has 37 letters. [2020-07-29 03:20:20,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 111 letters. Loop has 37 letters. [2020-07-29 03:20:20,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 111 letters. Loop has 37 letters. [2020-07-29 03:20:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 111 letters. Loop has 37 letters. [2020-07-29 03:20:20,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 111 letters. Loop has 37 letters. [2020-07-29 03:20:20,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 111 letters. Loop has 37 letters. [2020-07-29 03:20:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 111 letters. Loop has 37 letters. [2020-07-29 03:20:20,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 115 letters. Loop has 37 letters. [2020-07-29 03:20:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 115 letters. Loop has 37 letters. [2020-07-29 03:20:20,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 115 letters. Loop has 37 letters. [2020-07-29 03:20:20,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 87 letters. Loop has 37 letters. [2020-07-29 03:20:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 87 letters. Loop has 37 letters. [2020-07-29 03:20:20,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 87 letters. Loop has 37 letters. [2020-07-29 03:20:20,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 88 letters. Loop has 37 letters. [2020-07-29 03:20:20,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 88 letters. Loop has 37 letters. [2020-07-29 03:20:20,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 88 letters. Loop has 37 letters. [2020-07-29 03:20:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 120 letters. Loop has 37 letters. [2020-07-29 03:20:20,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 120 letters. Loop has 37 letters. [2020-07-29 03:20:20,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 120 letters. Loop has 37 letters. [2020-07-29 03:20:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 106 letters. Loop has 37 letters. [2020-07-29 03:20:20,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 106 letters. Loop has 37 letters. [2020-07-29 03:20:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 106 letters. Loop has 37 letters. [2020-07-29 03:20:20,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 104 letters. Loop has 37 letters. [2020-07-29 03:20:20,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 104 letters. Loop has 37 letters. [2020-07-29 03:20:20,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 104 letters. Loop has 37 letters. [2020-07-29 03:20:20,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:20:20,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:20:20,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:20:20,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 102 letters. Loop has 37 letters. [2020-07-29 03:20:20,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 102 letters. Loop has 37 letters. [2020-07-29 03:20:20,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 102 letters. Loop has 37 letters. [2020-07-29 03:20:20,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:20:20,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:20:20,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 60 letters. Loop has 37 letters. [2020-07-29 03:20:20,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 99 letters. Loop has 37 letters. [2020-07-29 03:20:20,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 99 letters. Loop has 37 letters. [2020-07-29 03:20:20,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 99 letters. Loop has 37 letters. [2020-07-29 03:20:20,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 112 letters. Loop has 37 letters. [2020-07-29 03:20:20,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 112 letters. Loop has 37 letters. [2020-07-29 03:20:20,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 112 letters. Loop has 37 letters. [2020-07-29 03:20:20,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 103 letters. Loop has 37 letters. [2020-07-29 03:20:20,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 103 letters. Loop has 37 letters. [2020-07-29 03:20:20,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 103 letters. Loop has 37 letters. [2020-07-29 03:20:20,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 116 letters. Loop has 37 letters. [2020-07-29 03:20:20,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 116 letters. Loop has 37 letters. [2020-07-29 03:20:20,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 116 letters. Loop has 37 letters. [2020-07-29 03:20:20,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:20,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 86 letters. Loop has 37 letters. [2020-07-29 03:20:21,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 86 letters. Loop has 37 letters. [2020-07-29 03:20:21,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 86 letters. Loop has 37 letters. [2020-07-29 03:20:21,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 85 letters. Loop has 37 letters. [2020-07-29 03:20:21,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 85 letters. Loop has 37 letters. [2020-07-29 03:20:21,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 85 letters. Loop has 37 letters. [2020-07-29 03:20:21,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 84 letters. Loop has 37 letters. [2020-07-29 03:20:21,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 37 letters. [2020-07-29 03:20:21,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 84 letters. Loop has 37 letters. [2020-07-29 03:20:21,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 83 letters. Loop has 37 letters. [2020-07-29 03:20:21,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 37 letters. [2020-07-29 03:20:21,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 83 letters. Loop has 37 letters. [2020-07-29 03:20:21,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 83 letters. Loop has 37 letters. [2020-07-29 03:20:21,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 37 letters. [2020-07-29 03:20:21,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 83 letters. Loop has 37 letters. [2020-07-29 03:20:21,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 82 letters. Loop has 37 letters. [2020-07-29 03:20:21,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 37 letters. [2020-07-29 03:20:21,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 82 letters. Loop has 37 letters. [2020-07-29 03:20:21,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 83 letters. Loop has 38 letters. [2020-07-29 03:20:21,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 83 letters. Loop has 38 letters. [2020-07-29 03:20:21,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 83 letters. Loop has 38 letters. [2020-07-29 03:20:21,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:20:21,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:20:21,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 84 letters. Loop has 39 letters. [2020-07-29 03:20:21,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 82 letters. Loop has 37 letters. [2020-07-29 03:20:21,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 82 letters. Loop has 37 letters. [2020-07-29 03:20:21,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 82 letters. Loop has 37 letters. [2020-07-29 03:20:21,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 81 letters. Loop has 37 letters. [2020-07-29 03:20:21,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 81 letters. Loop has 37 letters. [2020-07-29 03:20:21,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 81 letters. Loop has 37 letters. [2020-07-29 03:20:21,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 80 letters. Loop has 37 letters. [2020-07-29 03:20:21,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 37 letters. [2020-07-29 03:20:21,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 80 letters. Loop has 37 letters. [2020-07-29 03:20:21,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 79 letters. Loop has 37 letters. [2020-07-29 03:20:21,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 37 letters. [2020-07-29 03:20:21,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 79 letters. Loop has 37 letters. [2020-07-29 03:20:21,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 79 letters. Loop has 37 letters. [2020-07-29 03:20:21,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 37 letters. [2020-07-29 03:20:21,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 79 letters. Loop has 37 letters. [2020-07-29 03:20:21,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 80 letters. Loop has 39 letters. [2020-07-29 03:20:21,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 80 letters. Loop has 39 letters. [2020-07-29 03:20:21,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 80 letters. Loop has 39 letters. [2020-07-29 03:20:21,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 78 letters. Loop has 37 letters. [2020-07-29 03:20:21,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 37 letters. [2020-07-29 03:20:21,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 78 letters. Loop has 37 letters. [2020-07-29 03:20:21,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 79 letters. Loop has 38 letters. [2020-07-29 03:20:21,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 79 letters. Loop has 38 letters. [2020-07-29 03:20:21,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 79 letters. Loop has 38 letters. [2020-07-29 03:20:21,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 78 letters. Loop has 37 letters. [2020-07-29 03:20:21,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 78 letters. Loop has 37 letters. [2020-07-29 03:20:21,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 78 letters. Loop has 37 letters. [2020-07-29 03:20:21,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 77 letters. Loop has 37 letters. [2020-07-29 03:20:21,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 37 letters. [2020-07-29 03:20:21,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 77 letters. Loop has 37 letters. [2020-07-29 03:20:21,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 76 letters. Loop has 37 letters. [2020-07-29 03:20:21,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 37 letters. [2020-07-29 03:20:21,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 76 letters. Loop has 37 letters. [2020-07-29 03:20:21,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 75 letters. Loop has 37 letters. [2020-07-29 03:20:21,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 37 letters. [2020-07-29 03:20:21,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 75 letters. Loop has 37 letters. [2020-07-29 03:20:21,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 75 letters. Loop has 37 letters. [2020-07-29 03:20:21,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 37 letters. [2020-07-29 03:20:21,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 75 letters. Loop has 37 letters. [2020-07-29 03:20:21,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:20:21,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:20:21,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 76 letters. Loop has 39 letters. [2020-07-29 03:20:21,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:20:21,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:20:21,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:20:21,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:20:21,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:20:21,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 75 letters. Loop has 38 letters. [2020-07-29 03:20:21,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:20:21,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:20:21,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 74 letters. Loop has 37 letters. [2020-07-29 03:20:21,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:20:21,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:20:21,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 73 letters. Loop has 37 letters. [2020-07-29 03:20:21,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:20:21,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:20:21,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 72 letters. Loop has 37 letters. [2020-07-29 03:20:21,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 89 letters. Loop has 37 letters. [2020-07-29 03:20:21,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 89 letters. Loop has 37 letters. [2020-07-29 03:20:21,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 89 letters. Loop has 37 letters. [2020-07-29 03:20:21,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:20:21,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:20:21,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:20:21,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:20:21,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:20:21,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 71 letters. Loop has 37 letters. [2020-07-29 03:20:21,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:20:21,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:20:21,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 72 letters. Loop has 39 letters. [2020-07-29 03:20:21,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:20:21,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:20:21,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:20:21,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:20:21,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:20:21,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 71 letters. Loop has 38 letters. [2020-07-29 03:20:21,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:20:21,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:20:21,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 69 letters. Loop has 37 letters. [2020-07-29 03:20:21,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:20:21,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:20:21,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 70 letters. Loop has 37 letters. [2020-07-29 03:20:21,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:20:21,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:20:21,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 68 letters. Loop has 37 letters. [2020-07-29 03:20:21,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:20:21,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:20:21,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 67 letters. Loop has 37 letters. [2020-07-29 03:20:21,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 105 letters. Loop has 39 letters. [2020-07-29 03:20:21,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 105 letters. Loop has 39 letters. [2020-07-29 03:20:21,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 105 letters. Loop has 39 letters. [2020-07-29 03:20:21,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 104 letters. Loop has 38 letters. [2020-07-29 03:20:21,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 104 letters. Loop has 38 letters. [2020-07-29 03:20:21,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 104 letters. Loop has 38 letters. [2020-07-29 03:20:21,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:20:21,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:20:21,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 66 letters. Loop has 37 letters. [2020-07-29 03:20:21,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:20:21,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:20:21,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 65 letters. Loop has 37 letters. [2020-07-29 03:20:21,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:20:21,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:20:21,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 64 letters. Loop has 37 letters. [2020-07-29 03:20:21,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:20:21,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:20:21,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:20:21,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:20:21,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:20:21,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 63 letters. Loop has 37 letters. [2020-07-29 03:20:21,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 64 letters. Loop has 39 letters. [2020-07-29 03:20:21,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 39 letters. [2020-07-29 03:20:21,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 64 letters. Loop has 39 letters. [2020-07-29 03:20:21,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:20:21,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:20:21,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:20:21,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 63 letters. Loop has 38 letters. [2020-07-29 03:20:21,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 38 letters. [2020-07-29 03:20:21,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 63 letters. Loop has 38 letters. [2020-07-29 03:20:21,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:20:21,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:20:21,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 61 letters. Loop has 37 letters. [2020-07-29 03:20:21,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:20:21,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:20:21,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 62 letters. Loop has 37 letters. [2020-07-29 03:20:21,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:20:21,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:20:21,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 59 letters. Loop has 37 letters. [2020-07-29 03:20:21,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 58 letters. Loop has 37 letters. [2020-07-29 03:20:21,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 37 letters. [2020-07-29 03:20:21,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 58 letters. Loop has 37 letters. [2020-07-29 03:20:21,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 57 letters. Loop has 37 letters. [2020-07-29 03:20:21,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 37 letters. [2020-07-29 03:20:21,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 57 letters. Loop has 37 letters. [2020-07-29 03:20:21,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 92 letters. Loop has 37 letters. [2020-07-29 03:20:21,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 92 letters. Loop has 37 letters. [2020-07-29 03:20:21,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 92 letters. Loop has 37 letters. [2020-07-29 03:20:21,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 91 letters. Loop has 37 letters. [2020-07-29 03:20:21,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 37 letters. [2020-07-29 03:20:21,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 91 letters. Loop has 37 letters. [2020-07-29 03:20:21,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 90 letters. Loop has 37 letters. [2020-07-29 03:20:21,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 90 letters. Loop has 37 letters. [2020-07-29 03:20:21,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 90 letters. Loop has 37 letters. [2020-07-29 03:20:21,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 182 states and 251 transitions. cyclomatic complexity: 70 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:21,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:21,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 307 states and 446 transitions. cyclomatic complexity: 140 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:20:21,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,080 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:20:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:20:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2020-07-29 03:20:21,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 37 letters. [2020-07-29 03:20:21,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 93 letters. Loop has 37 letters. [2020-07-29 03:20:21,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 74 letters. [2020-07-29 03:20:21,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:20:21,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 446 transitions. cyclomatic complexity: 140 [2020-07-29 03:20:21,100 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:21,100 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 0 states and 0 transitions. [2020-07-29 03:20:21,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:20:21,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:20:21,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:20:21,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:21,101 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:21,101 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:21,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:20:21,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:20:21,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:20:21,102 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:20:21,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:20:21,102 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:20:21,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:20:21,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:20:21,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:20:21,224 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:20:21,225 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:21,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:20:21,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:20:21,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:20:21,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:20:21,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:20:21,226 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:21,226 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:21,226 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:20:21,226 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:20:21,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:20:21,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:20:21,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:20:21,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:20:21 BoogieIcfgContainer [2020-07-29 03:20:21,237 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:20:21,238 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:20:21,238 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:20:21,238 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:20:21,239 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:20:04" (3/4) ... [2020-07-29 03:20:21,243 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:20:21,243 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:20:21,246 INFO L168 Benchmark]: Toolchain (without parser) took 18067.50 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 521.1 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 353.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:21,247 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:20:21,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 579.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:21,251 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.61 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:21,254 INFO L168 Benchmark]: Boogie Preprocessor took 49.13 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:20:21,255 INFO L168 Benchmark]: RCFGBuilder took 1057.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:21,256 INFO L168 Benchmark]: BuchiAutomizer took 16282.55 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 391.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -103.1 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:20:21,256 INFO L168 Benchmark]: Witness Printer took 5.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:20:21,265 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 579.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.61 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.13 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 1057.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.7 MB). Peak memory consumption was 84.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16282.55 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 391.6 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -103.1 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.47 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 27 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 12.6s. Construction of modules took 0.1s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 182 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 779 SDtfs, 320 SDslu, 1316 SDs, 0 SdLazy, 36 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital237 mio100 ax135 hnf108 lsp38 ukn82 mio100 lsp100 div127 bol100 ite100 ukn100 eq197 hnf77 smp100 dnf727 smp49 tf100 neg99 sie101 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...