./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 69812cdac6fd42ecebafb7c407f35083f9c8c833 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:17:29,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:17:29,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:17:29,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:17:29,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:17:29,876 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:17:29,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:17:29,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:17:29,883 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:17:29,884 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:17:29,886 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:17:29,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:17:29,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:17:29,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:17:29,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:17:29,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:17:29,894 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:17:29,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:17:29,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:17:29,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:17:29,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:17:29,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:17:29,914 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:17:29,917 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:17:29,923 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:17:29,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:17:29,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:17:29,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:17:29,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:17:29,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:17:29,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:17:29,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:17:29,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:17:29,934 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:17:29,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:17:29,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:17:29,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:17:29,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:17:29,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:17:29,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:17:29,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:17:29,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:17:29,980 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:17:29,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:17:29,984 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:17:29,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:17:29,985 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:17:29,985 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:17:29,986 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:17:29,986 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:17:29,986 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:17:29,987 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:17:29,988 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:17:29,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:17:29,989 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:17:29,990 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:17:29,990 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:17:29,990 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:17:29,991 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:17:29,991 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:17:29,991 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:17:29,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:17:29,993 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:17:29,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:17:29,994 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:17:29,995 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:17:29,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:17:29,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:17:29,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:17:29,996 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:17:29,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:17:29,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:17:29,997 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:17:29,997 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:17:29,999 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:17:29,999 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 -> 69812cdac6fd42ecebafb7c407f35083f9c8c833 [2020-07-29 03:17:30,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:17:30,343 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:17:30,347 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:17:30,349 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:17:30,350 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:17:30,351 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:30,420 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf758a3c/93eed2bd96474895b40891adcb88d948/FLAG4151da403 [2020-07-29 03:17:31,055 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:17:31,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:31,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf758a3c/93eed2bd96474895b40891adcb88d948/FLAG4151da403 [2020-07-29 03:17:31,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9cf758a3c/93eed2bd96474895b40891adcb88d948 [2020-07-29 03:17:31,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:17:31,346 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:17:31,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:31,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:17:31,352 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:17:31,354 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:31,358 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c45776f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31, skipping insertion in model container [2020-07-29 03:17:31,358 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:31,366 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:17:31,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:17:31,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:31,801 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:17:31,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:17:31,923 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:17:31,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31 WrapperNode [2020-07-29 03:17:31,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:17:31,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:31,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:17:31,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:17:31,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:31,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,024 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:17:32,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:17:32,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:17:32,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:17:32,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,063 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,076 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... [2020-07-29 03:17:32,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:17:32,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:17:32,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:17:32,098 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:17:32,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:32,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:17:32,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:17:33,276 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:17:33,277 INFO L295 CfgBuilder]: Removed 25 assume(true) statements. [2020-07-29 03:17:33,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:33 BoogieIcfgContainer [2020-07-29 03:17:33,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:17:33,289 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:17:33,289 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:17:33,294 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:17:33,294 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:33,295 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:17:31" (1/3) ... [2020-07-29 03:17:33,296 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@231c5e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:33, skipping insertion in model container [2020-07-29 03:17:33,296 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:33,297 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:17:31" (2/3) ... [2020-07-29 03:17:33,297 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@231c5e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:17:33, skipping insertion in model container [2020-07-29 03:17:33,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:17:33,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:33" (3/3) ... [2020-07-29 03:17:33,300 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c [2020-07-29 03:17:33,348 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:17:33,348 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:17:33,348 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:17:33,349 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:17:33,349 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:17:33,349 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:17:33,349 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:17:33,350 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:17:33,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states. [2020-07-29 03:17:33,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2020-07-29 03:17:33,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:33,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:33,441 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:33,441 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:33,442 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:17:33,442 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 144 states. [2020-07-29 03:17:33,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 93 [2020-07-29 03:17:33,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:33,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:33,462 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:33,462 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:33,471 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 16#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 36#L337true assume !(0 == ~r1~0);init_~tmp~0 := 0; 38#L337-1true init_#res := init_~tmp~0; 49#L502true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 58#L67true assume 0 == assume_abort_if_not_~cond;assume false; 112#L66true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 104#L578-2true [2020-07-29 03:17:33,473 INFO L796 eck$LassoCheckResult]: Loop: 104#L578-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 127#L129true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 43#L133true assume !(node1_~m1~0 != ~nomsg~0); 59#L133-1true ~mode1~0 := 0; 121#L129-2true havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 46#L166true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 27#L169true assume !(node2_~m2~0 != ~nomsg~0); 25#L169-1true ~mode2~0 := 0; 60#L166-2true havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 136#L200true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 140#L203true assume !(node3_~m3~0 != ~nomsg~0); 139#L203-1true ~mode3~0 := 0; 133#L200-2true havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 109#L234true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 89#L237true assume !(node4_~m4~0 != ~nomsg~0); 86#L237-1true ~mode4~0 := 0; 81#L234-2true havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 57#L268true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 24#L271true assume !(node5_~m5~0 != ~nomsg~0); 40#L271-1true ~mode5~0 := 0; 53#L268-2true havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 144#L302true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 128#L305true assume !(node6_~m6~0 != ~nomsg~0); 130#L305-1true ~mode6~0 := 0; 141#L302-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 55#L510true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 56#L510-1true check_#res := check_~tmp~1; 13#L522true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 97#L611true assume !(0 == assert_~arg % 256); 73#L606true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 104#L578-2true [2020-07-29 03:17:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2035845626, now seen corresponding path program 1 times [2020-07-29 03:17:33,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:33,490 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876361903] [2020-07-29 03:17:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:33,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {148#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {148#true} is VALID [2020-07-29 03:17:33,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {148#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {148#true} is VALID [2020-07-29 03:17:33,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {148#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {148#true} is VALID [2020-07-29 03:17:33,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {148#true} init_#res := init_~tmp~0; {148#true} is VALID [2020-07-29 03:17:33,681 INFO L280 TraceCheckUtils]: 4: Hoare triple {148#true} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {148#true} is VALID [2020-07-29 03:17:33,682 INFO L280 TraceCheckUtils]: 5: Hoare triple {148#true} assume 0 == assume_abort_if_not_~cond;assume false; {149#false} is VALID [2020-07-29 03:17:33,683 INFO L280 TraceCheckUtils]: 6: Hoare triple {149#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {149#false} is VALID [2020-07-29 03:17:33,686 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:17:33,686 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876361903] [2020-07-29 03:17:33,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:33,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 03:17:33,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732260552] [2020-07-29 03:17:33,695 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 1 times [2020-07-29 03:17:33,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:33,697 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110273083] [2020-07-29 03:17:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:33,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {150#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {150#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {150#true} assume !(node1_~m1~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:17:33,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {150#true} ~mode1~0 := 0; {150#true} is VALID [2020-07-29 03:17:33,943 INFO L280 TraceCheckUtils]: 4: Hoare triple {150#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {150#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,944 INFO L280 TraceCheckUtils]: 6: Hoare triple {150#true} assume !(node2_~m2~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:17:33,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {150#true} ~mode2~0 := 0; {150#true} is VALID [2020-07-29 03:17:33,945 INFO L280 TraceCheckUtils]: 8: Hoare triple {150#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,945 INFO L280 TraceCheckUtils]: 9: Hoare triple {150#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {150#true} assume !(node3_~m3~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:17:33,948 INFO L280 TraceCheckUtils]: 11: Hoare triple {150#true} ~mode3~0 := 0; {150#true} is VALID [2020-07-29 03:17:33,948 INFO L280 TraceCheckUtils]: 12: Hoare triple {150#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,949 INFO L280 TraceCheckUtils]: 13: Hoare triple {150#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,950 INFO L280 TraceCheckUtils]: 14: Hoare triple {150#true} assume !(node4_~m4~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:17:33,951 INFO L280 TraceCheckUtils]: 15: Hoare triple {150#true} ~mode4~0 := 0; {150#true} is VALID [2020-07-29 03:17:33,953 INFO L280 TraceCheckUtils]: 16: Hoare triple {150#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {150#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,955 INFO L280 TraceCheckUtils]: 18: Hoare triple {150#true} assume !(node5_~m5~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:17:33,955 INFO L280 TraceCheckUtils]: 19: Hoare triple {150#true} ~mode5~0 := 0; {150#true} is VALID [2020-07-29 03:17:33,956 INFO L280 TraceCheckUtils]: 20: Hoare triple {150#true} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,957 INFO L280 TraceCheckUtils]: 21: Hoare triple {150#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {150#true} is VALID [2020-07-29 03:17:33,957 INFO L280 TraceCheckUtils]: 22: Hoare triple {150#true} assume !(node6_~m6~0 != ~nomsg~0); {150#true} is VALID [2020-07-29 03:17:33,958 INFO L280 TraceCheckUtils]: 23: Hoare triple {150#true} ~mode6~0 := 0; {150#true} is VALID [2020-07-29 03:17:33,959 INFO L280 TraceCheckUtils]: 24: Hoare triple {150#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {150#true} is VALID [2020-07-29 03:17:33,960 INFO L280 TraceCheckUtils]: 25: Hoare triple {150#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {152#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:33,962 INFO L280 TraceCheckUtils]: 26: Hoare triple {152#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {153#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:33,964 INFO L280 TraceCheckUtils]: 27: Hoare triple {153#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {154#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:33,966 INFO L280 TraceCheckUtils]: 28: Hoare triple {154#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {151#false} is VALID [2020-07-29 03:17:33,966 INFO L280 TraceCheckUtils]: 29: Hoare triple {151#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {151#false} is VALID [2020-07-29 03:17:33,976 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:17:33,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110273083] [2020-07-29 03:17:33,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:33,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:33,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672326438] [2020-07-29 03:17:33,984 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:33,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-29 03:17:34,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-29 03:17:34,007 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 2 states. [2020-07-29 03:17:34,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:34,250 INFO L93 Difference]: Finished difference Result 144 states and 242 transitions. [2020-07-29 03:17:34,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:34,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 03:17:34,272 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:17:34,275 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 242 transitions. [2020-07-29 03:17:34,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:17:34,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 139 states and 237 transitions. [2020-07-29 03:17:34,302 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-07-29 03:17:34,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-07-29 03:17:34,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 237 transitions. [2020-07-29 03:17:34,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:34,306 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2020-07-29 03:17:34,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 237 transitions. [2020-07-29 03:17:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-07-29 03:17:34,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:34,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 237 transitions. Second operand 139 states. [2020-07-29 03:17:34,354 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 237 transitions. Second operand 139 states. [2020-07-29 03:17:34,355 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. Second operand 139 states. [2020-07-29 03:17:34,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:34,366 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2020-07-29 03:17:34,366 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2020-07-29 03:17:34,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:34,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:34,369 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states and 237 transitions. [2020-07-29 03:17:34,370 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states and 237 transitions. [2020-07-29 03:17:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:34,379 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2020-07-29 03:17:34,379 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 237 transitions. [2020-07-29 03:17:34,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:34,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:34,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:34,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:34,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-07-29 03:17:34,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 237 transitions. [2020-07-29 03:17:34,391 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2020-07-29 03:17:34,391 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 237 transitions. [2020-07-29 03:17:34,391 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:17:34,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 237 transitions. [2020-07-29 03:17:34,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:17:34,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:34,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:34,397 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:34,397 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:34,397 INFO L794 eck$LassoCheckResult]: Stem: 432#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 328#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 329#L337 assume !(0 == ~r1~0);init_~tmp~0 := 0; 307#L337-1 init_#res := init_~tmp~0; 363#L502 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 382#L67 assume !(0 == assume_abort_if_not_~cond); 390#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 407#L578-2 [2020-07-29 03:17:34,398 INFO L796 eck$LassoCheckResult]: Loop: 407#L578-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 429#L129 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 372#L133 assume !(node1_~m1~0 != ~nomsg~0); 374#L133-1 ~mode1~0 := 0; 393#L129-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 379#L166 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 346#L169 assume !(node2_~m2~0 != ~nomsg~0); 343#L169-1 ~mode2~0 := 0; 338#L166-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 394#L200 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 437#L203 assume !(node3_~m3~0 != ~nomsg~0); 305#L203-1 ~mode3~0 := 0; 422#L200-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 431#L234 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 419#L237 assume !(node4_~m4~0 != ~nomsg~0); 366#L237-1 ~mode4~0 := 0; 380#L234-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 389#L268 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 340#L271 assume !(node5_~m5~0 != ~nomsg~0); 342#L271-1 ~mode5~0 := 0; 367#L268-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 386#L302 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 435#L305 assume !(node6_~m6~0 != ~nomsg~0); 317#L305-1 ~mode6~0 := 0; 428#L302-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 388#L510 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 324#L510-1 check_#res := check_~tmp~1; 321#L522 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 322#L611 assume !(0 == assert_~arg % 256); 406#L606 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 407#L578-2 [2020-07-29 03:17:34,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash 2035845688, now seen corresponding path program 1 times [2020-07-29 03:17:34,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:34,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999468563] [2020-07-29 03:17:34,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:34,485 INFO L280 TraceCheckUtils]: 0: Hoare triple {719#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {719#true} is VALID [2020-07-29 03:17:34,486 INFO L280 TraceCheckUtils]: 1: Hoare triple {719#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {719#true} is VALID [2020-07-29 03:17:34,487 INFO L280 TraceCheckUtils]: 2: Hoare triple {719#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {721#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:17:34,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {721#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {722#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:17:34,489 INFO L280 TraceCheckUtils]: 4: Hoare triple {722#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {723#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} is VALID [2020-07-29 03:17:34,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {723#(= 0 ULTIMATE.start_assume_abort_if_not_~cond)} assume !(0 == assume_abort_if_not_~cond); {720#false} is VALID [2020-07-29 03:17:34,491 INFO L280 TraceCheckUtils]: 6: Hoare triple {720#false} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {720#false} is VALID [2020-07-29 03:17:34,491 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:17:34,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999468563] [2020-07-29 03:17:34,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:34,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:34,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837101216] [2020-07-29 03:17:34,493 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:17:34,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:34,493 INFO L82 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 2 times [2020-07-29 03:17:34,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:34,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401775389] [2020-07-29 03:17:34,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:34,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {724#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,674 INFO L280 TraceCheckUtils]: 1: Hoare triple {724#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,674 INFO L280 TraceCheckUtils]: 2: Hoare triple {724#true} assume !(node1_~m1~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:17:34,675 INFO L280 TraceCheckUtils]: 3: Hoare triple {724#true} ~mode1~0 := 0; {724#true} is VALID [2020-07-29 03:17:34,675 INFO L280 TraceCheckUtils]: 4: Hoare triple {724#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,675 INFO L280 TraceCheckUtils]: 5: Hoare triple {724#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,676 INFO L280 TraceCheckUtils]: 6: Hoare triple {724#true} assume !(node2_~m2~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:17:34,676 INFO L280 TraceCheckUtils]: 7: Hoare triple {724#true} ~mode2~0 := 0; {724#true} is VALID [2020-07-29 03:17:34,676 INFO L280 TraceCheckUtils]: 8: Hoare triple {724#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {724#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,677 INFO L280 TraceCheckUtils]: 10: Hoare triple {724#true} assume !(node3_~m3~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:17:34,682 INFO L280 TraceCheckUtils]: 11: Hoare triple {724#true} ~mode3~0 := 0; {724#true} is VALID [2020-07-29 03:17:34,682 INFO L280 TraceCheckUtils]: 12: Hoare triple {724#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {724#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {724#true} assume !(node4_~m4~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:17:34,684 INFO L280 TraceCheckUtils]: 15: Hoare triple {724#true} ~mode4~0 := 0; {724#true} is VALID [2020-07-29 03:17:34,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {724#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,686 INFO L280 TraceCheckUtils]: 17: Hoare triple {724#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,687 INFO L280 TraceCheckUtils]: 18: Hoare triple {724#true} assume !(node5_~m5~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:17:34,688 INFO L280 TraceCheckUtils]: 19: Hoare triple {724#true} ~mode5~0 := 0; {724#true} is VALID [2020-07-29 03:17:34,688 INFO L280 TraceCheckUtils]: 20: Hoare triple {724#true} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,689 INFO L280 TraceCheckUtils]: 21: Hoare triple {724#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {724#true} is VALID [2020-07-29 03:17:34,689 INFO L280 TraceCheckUtils]: 22: Hoare triple {724#true} assume !(node6_~m6~0 != ~nomsg~0); {724#true} is VALID [2020-07-29 03:17:34,689 INFO L280 TraceCheckUtils]: 23: Hoare triple {724#true} ~mode6~0 := 0; {724#true} is VALID [2020-07-29 03:17:34,690 INFO L280 TraceCheckUtils]: 24: Hoare triple {724#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {724#true} is VALID [2020-07-29 03:17:34,691 INFO L280 TraceCheckUtils]: 25: Hoare triple {724#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {726#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:34,692 INFO L280 TraceCheckUtils]: 26: Hoare triple {726#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {727#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:34,694 INFO L280 TraceCheckUtils]: 27: Hoare triple {727#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {728#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:34,695 INFO L280 TraceCheckUtils]: 28: Hoare triple {728#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {725#false} is VALID [2020-07-29 03:17:34,695 INFO L280 TraceCheckUtils]: 29: Hoare triple {725#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {725#false} is VALID [2020-07-29 03:17:34,697 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:17:34,698 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401775389] [2020-07-29 03:17:34,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:34,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:34,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007169557] [2020-07-29 03:17:34,699 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:34,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:34,700 INFO L87 Difference]: Start difference. First operand 139 states and 237 transitions. cyclomatic complexity: 99 Second operand 5 states. [2020-07-29 03:17:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:35,496 INFO L93 Difference]: Finished difference Result 142 states and 239 transitions. [2020-07-29 03:17:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:35,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:35,508 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:17:35,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 239 transitions. [2020-07-29 03:17:35,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:17:35,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 196 transitions. [2020-07-29 03:17:35,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-07-29 03:17:35,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-07-29 03:17:35,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 196 transitions. [2020-07-29 03:17:35,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:35,526 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2020-07-29 03:17:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 196 transitions. [2020-07-29 03:17:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-07-29 03:17:35,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:35,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 196 transitions. Second operand 139 states. [2020-07-29 03:17:35,534 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 196 transitions. Second operand 139 states. [2020-07-29 03:17:35,535 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. Second operand 139 states. [2020-07-29 03:17:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:35,541 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2020-07-29 03:17:35,542 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2020-07-29 03:17:35,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:35,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:35,543 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states and 196 transitions. [2020-07-29 03:17:35,544 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states and 196 transitions. [2020-07-29 03:17:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:35,550 INFO L93 Difference]: Finished difference Result 139 states and 196 transitions. [2020-07-29 03:17:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 196 transitions. [2020-07-29 03:17:35,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:35,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:35,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:35,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-07-29 03:17:35,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 196 transitions. [2020-07-29 03:17:35,559 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2020-07-29 03:17:35,559 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 196 transitions. [2020-07-29 03:17:35,559 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:17:35,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 196 transitions. [2020-07-29 03:17:35,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:17:35,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:35,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:35,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:35,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:35,564 INFO L794 eck$LassoCheckResult]: Stem: 1008#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 905#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 906#L337 assume 0 == ~r1~0; 936#L338 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 985#L339 assume ~id1~0 >= 0; 907#L340 assume 0 == ~st1~0; 908#L341 assume ~send1~0 == ~id1~0; 978#L342 assume 0 == ~mode1~0 % 256; 889#L343 assume ~id2~0 >= 0; 890#L344 assume 0 == ~st2~0; 946#L345 assume ~send2~0 == ~id2~0; 947#L346 assume 0 == ~mode2~0 % 256; 997#L347 assume ~id3~0 >= 0; 934#L348 assume 0 == ~st3~0; 935#L349 assume ~send3~0 == ~id3~0; 984#L350 assume 0 == ~mode3~0 % 256; 925#L351 assume ~id4~0 >= 0; 926#L352 assume 0 == ~st4~0; 977#L353 assume ~send4~0 == ~id4~0; 886#L354 assume 0 == ~mode4~0 % 256; 887#L355 assume ~id5~0 >= 0; 944#L356 assume 0 == ~st5~0; 945#L357 assume ~send5~0 == ~id5~0; 996#L358 assume 0 == ~mode5~0 % 256; 930#L359 assume ~id6~0 >= 0; 931#L360 assume 0 == ~st6~0; 981#L361 assume ~send6~0 == ~id6~0; 923#L362 assume 0 == ~mode6~0 % 256; 924#L363 assume ~id1~0 != ~id2~0; 976#L364 assume ~id1~0 != ~id3~0; 884#L365 assume ~id1~0 != ~id4~0; 885#L366 assume ~id1~0 != ~id5~0; 967#L367 assume ~id1~0 != ~id6~0; 968#L368 assume ~id2~0 != ~id3~0; 994#L369 assume ~id2~0 != ~id4~0; 928#L370 assume ~id2~0 != ~id5~0; 929#L371 assume ~id2~0 != ~id6~0; 980#L372 assume ~id3~0 != ~id4~0; 919#L373 assume ~id3~0 != ~id5~0; 920#L374 assume ~id3~0 != ~id6~0; 975#L375 assume ~id4~0 != ~id5~0; 882#L376 assume ~id4~0 != ~id6~0; 883#L377 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 938#L337-1 init_#res := init_~tmp~0; 939#L502 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 958#L67 assume !(0 == assume_abort_if_not_~cond); 966#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 983#L578-2 [2020-07-29 03:17:35,565 INFO L796 eck$LassoCheckResult]: Loop: 983#L578-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1004#L129 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 948#L133 assume !(node1_~m1~0 != ~nomsg~0); 950#L133-1 ~mode1~0 := 0; 969#L129-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 955#L166 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 921#L169 assume !(node2_~m2~0 != ~nomsg~0); 918#L169-1 ~mode2~0 := 0; 913#L166-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 970#L200 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1013#L203 assume !(node3_~m3~0 != ~nomsg~0); 881#L203-1 ~mode3~0 := 0; 998#L200-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1007#L234 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 995#L237 assume !(node4_~m4~0 != ~nomsg~0); 942#L237-1 ~mode4~0 := 0; 956#L234-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 965#L268 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 915#L271 assume !(node5_~m5~0 != ~nomsg~0); 917#L271-1 ~mode5~0 := 0; 943#L268-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 962#L302 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1011#L305 assume !(node6_~m6~0 != ~nomsg~0); 895#L305-1 ~mode6~0 := 0; 1005#L302-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 964#L510 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 901#L510-1 check_#res := check_~tmp~1; 896#L522 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 897#L611 assume !(0 == assert_~arg % 256); 982#L606 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 983#L578-2 [2020-07-29 03:17:35,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:35,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 1 times [2020-07-29 03:17:35,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:35,592 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409882909] [2020-07-29 03:17:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:35,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:35,718 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:35,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:35,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash -373862285, now seen corresponding path program 3 times [2020-07-29 03:17:35,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:35,764 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299164773] [2020-07-29 03:17:35,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:35,865 INFO L280 TraceCheckUtils]: 0: Hoare triple {1297#true} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {1297#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {1297#true} assume !(node1_~m1~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:17:35,865 INFO L280 TraceCheckUtils]: 3: Hoare triple {1297#true} ~mode1~0 := 0; {1297#true} is VALID [2020-07-29 03:17:35,866 INFO L280 TraceCheckUtils]: 4: Hoare triple {1297#true} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {1297#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,866 INFO L280 TraceCheckUtils]: 6: Hoare triple {1297#true} assume !(node2_~m2~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:17:35,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {1297#true} ~mode2~0 := 0; {1297#true} is VALID [2020-07-29 03:17:35,866 INFO L280 TraceCheckUtils]: 8: Hoare triple {1297#true} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,867 INFO L280 TraceCheckUtils]: 9: Hoare triple {1297#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,867 INFO L280 TraceCheckUtils]: 10: Hoare triple {1297#true} assume !(node3_~m3~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:17:35,867 INFO L280 TraceCheckUtils]: 11: Hoare triple {1297#true} ~mode3~0 := 0; {1297#true} is VALID [2020-07-29 03:17:35,868 INFO L280 TraceCheckUtils]: 12: Hoare triple {1297#true} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,868 INFO L280 TraceCheckUtils]: 13: Hoare triple {1297#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,868 INFO L280 TraceCheckUtils]: 14: Hoare triple {1297#true} assume !(node4_~m4~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:17:35,869 INFO L280 TraceCheckUtils]: 15: Hoare triple {1297#true} ~mode4~0 := 0; {1297#true} is VALID [2020-07-29 03:17:35,869 INFO L280 TraceCheckUtils]: 16: Hoare triple {1297#true} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,869 INFO L280 TraceCheckUtils]: 17: Hoare triple {1297#true} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,869 INFO L280 TraceCheckUtils]: 18: Hoare triple {1297#true} assume !(node5_~m5~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:17:35,870 INFO L280 TraceCheckUtils]: 19: Hoare triple {1297#true} ~mode5~0 := 0; {1297#true} is VALID [2020-07-29 03:17:35,870 INFO L280 TraceCheckUtils]: 20: Hoare triple {1297#true} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,870 INFO L280 TraceCheckUtils]: 21: Hoare triple {1297#true} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1297#true} is VALID [2020-07-29 03:17:35,870 INFO L280 TraceCheckUtils]: 22: Hoare triple {1297#true} assume !(node6_~m6~0 != ~nomsg~0); {1297#true} is VALID [2020-07-29 03:17:35,871 INFO L280 TraceCheckUtils]: 23: Hoare triple {1297#true} ~mode6~0 := 0; {1297#true} is VALID [2020-07-29 03:17:35,871 INFO L280 TraceCheckUtils]: 24: Hoare triple {1297#true} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1297#true} is VALID [2020-07-29 03:17:35,872 INFO L280 TraceCheckUtils]: 25: Hoare triple {1297#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; {1299#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:35,873 INFO L280 TraceCheckUtils]: 26: Hoare triple {1299#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {1300#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:35,874 INFO L280 TraceCheckUtils]: 27: Hoare triple {1300#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1301#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:35,875 INFO L280 TraceCheckUtils]: 28: Hoare triple {1301#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {1298#false} is VALID [2020-07-29 03:17:35,875 INFO L280 TraceCheckUtils]: 29: Hoare triple {1298#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {1298#false} is VALID [2020-07-29 03:17:35,876 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:17:35,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299164773] [2020-07-29 03:17:35,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:35,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:35,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267735024] [2020-07-29 03:17:35,878 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:35,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:35,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:35,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:35,879 INFO L87 Difference]: Start difference. First operand 139 states and 196 transitions. cyclomatic complexity: 58 Second operand 5 states. [2020-07-29 03:17:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:36,437 INFO L93 Difference]: Finished difference Result 142 states and 198 transitions. [2020-07-29 03:17:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:36,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:36,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:36,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 198 transitions. [2020-07-29 03:17:36,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:17:36,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 139 states and 194 transitions. [2020-07-29 03:17:36,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 139 [2020-07-29 03:17:36,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 139 [2020-07-29 03:17:36,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 194 transitions. [2020-07-29 03:17:36,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:36,489 INFO L688 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2020-07-29 03:17:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 194 transitions. [2020-07-29 03:17:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2020-07-29 03:17:36,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:36,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states and 194 transitions. Second operand 139 states. [2020-07-29 03:17:36,495 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states and 194 transitions. Second operand 139 states. [2020-07-29 03:17:36,495 INFO L87 Difference]: Start difference. First operand 139 states and 194 transitions. Second operand 139 states. [2020-07-29 03:17:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:36,500 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2020-07-29 03:17:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2020-07-29 03:17:36,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:36,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:36,501 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 139 states and 194 transitions. [2020-07-29 03:17:36,501 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 139 states and 194 transitions. [2020-07-29 03:17:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:36,506 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2020-07-29 03:17:36,506 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 194 transitions. [2020-07-29 03:17:36,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:36,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:36,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:36,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-07-29 03:17:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 194 transitions. [2020-07-29 03:17:36,512 INFO L711 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2020-07-29 03:17:36,512 INFO L591 BuchiCegarLoop]: Abstraction has 139 states and 194 transitions. [2020-07-29 03:17:36,512 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:17:36,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. [2020-07-29 03:17:36,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2020-07-29 03:17:36,514 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:36,514 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:36,515 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:36,515 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:36,516 INFO L794 eck$LassoCheckResult]: Stem: 1581#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 1476#L-1 havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 1477#L337 assume 0 == ~r1~0; 1509#L338 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 1558#L339 assume ~id1~0 >= 0; 1478#L340 assume 0 == ~st1~0; 1479#L341 assume ~send1~0 == ~id1~0; 1551#L342 assume 0 == ~mode1~0 % 256; 1461#L343 assume ~id2~0 >= 0; 1462#L344 assume 0 == ~st2~0; 1519#L345 assume ~send2~0 == ~id2~0; 1520#L346 assume 0 == ~mode2~0 % 256; 1570#L347 assume ~id3~0 >= 0; 1505#L348 assume 0 == ~st3~0; 1506#L349 assume ~send3~0 == ~id3~0; 1555#L350 assume 0 == ~mode3~0 % 256; 1498#L351 assume ~id4~0 >= 0; 1499#L352 assume 0 == ~st4~0; 1550#L353 assume ~send4~0 == ~id4~0; 1459#L354 assume 0 == ~mode4~0 % 256; 1460#L355 assume ~id5~0 >= 0; 1517#L356 assume 0 == ~st5~0; 1518#L357 assume ~send5~0 == ~id5~0; 1568#L358 assume 0 == ~mode5~0 % 256; 1503#L359 assume ~id6~0 >= 0; 1504#L360 assume 0 == ~st6~0; 1554#L361 assume ~send6~0 == ~id6~0; 1494#L362 assume 0 == ~mode6~0 % 256; 1495#L363 assume ~id1~0 != ~id2~0; 1549#L364 assume ~id1~0 != ~id3~0; 1457#L365 assume ~id1~0 != ~id4~0; 1458#L366 assume ~id1~0 != ~id5~0; 1540#L367 assume ~id1~0 != ~id6~0; 1541#L368 assume ~id2~0 != ~id3~0; 1567#L369 assume ~id2~0 != ~id4~0; 1501#L370 assume ~id2~0 != ~id5~0; 1502#L371 assume ~id2~0 != ~id6~0; 1553#L372 assume ~id3~0 != ~id4~0; 1492#L373 assume ~id3~0 != ~id5~0; 1493#L374 assume ~id3~0 != ~id6~0; 1548#L375 assume ~id4~0 != ~id5~0; 1455#L376 assume ~id4~0 != ~id6~0; 1456#L377 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 1511#L337-1 init_#res := init_~tmp~0; 1512#L502 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 1531#L67 assume !(0 == assume_abort_if_not_~cond); 1539#L66 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 1557#L578-2 [2020-07-29 03:17:36,516 INFO L796 eck$LassoCheckResult]: Loop: 1557#L578-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 1577#L129 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 1521#L133 assume !(node1_~m1~0 != ~nomsg~0); 1523#L133-1 ~mode1~0 := 0; 1542#L129-2 havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1528#L166 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1496#L169 assume !(node2_~m2~0 != ~nomsg~0); 1491#L169-1 ~mode2~0 := 0; 1486#L166-2 havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1543#L200 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1586#L203 assume !(node3_~m3~0 != ~nomsg~0); 1454#L203-1 ~mode3~0 := 0; 1571#L200-2 havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1580#L234 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1569#L237 assume !(node4_~m4~0 != ~nomsg~0); 1515#L237-1 ~mode4~0 := 0; 1529#L234-2 havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 1538#L268 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1488#L271 assume !(node5_~m5~0 != ~nomsg~0); 1490#L271-1 ~mode5~0 := 0; 1516#L268-2 havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 1535#L302 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 1584#L305 assume !(node6_~m6~0 != ~nomsg~0); 1468#L305-1 ~mode6~0 := 0; 1578#L302-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 1537#L510 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 1473#L511 assume ~r1~0 < 6;check_~tmp~1 := 1; 1474#L510-1 check_#res := check_~tmp~1; 1469#L522 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1470#L611 assume !(0 == assert_~arg % 256); 1556#L606 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 1557#L578-2 [2020-07-29 03:17:36,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1766357374, now seen corresponding path program 2 times [2020-07-29 03:17:36,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:36,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268071259] [2020-07-29 03:17:36,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:36,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:36,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:36,585 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:36,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:36,586 INFO L82 PathProgramCache]: Analyzing trace with hash 911844111, now seen corresponding path program 1 times [2020-07-29 03:17:36,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:36,587 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564355745] [2020-07-29 03:17:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:36,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:36,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:36,615 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:36,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:36,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1786874990, now seen corresponding path program 1 times [2020-07-29 03:17:36,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:36,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72224348] [2020-07-29 03:17:36,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:36,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:36,714 INFO L280 TraceCheckUtils]: 0: Hoare triple {1872#true} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1872#true} is VALID [2020-07-29 03:17:36,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {1872#true} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1872#true} is VALID [2020-07-29 03:17:36,715 INFO L280 TraceCheckUtils]: 2: Hoare triple {1872#true} assume 0 == ~r1~0; {1872#true} is VALID [2020-07-29 03:17:36,715 INFO L280 TraceCheckUtils]: 3: Hoare triple {1872#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1872#true} is VALID [2020-07-29 03:17:36,715 INFO L280 TraceCheckUtils]: 4: Hoare triple {1872#true} assume ~id1~0 >= 0; {1872#true} is VALID [2020-07-29 03:17:36,716 INFO L280 TraceCheckUtils]: 5: Hoare triple {1872#true} assume 0 == ~st1~0; {1872#true} is VALID [2020-07-29 03:17:36,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {1872#true} assume ~send1~0 == ~id1~0; {1872#true} is VALID [2020-07-29 03:17:36,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {1872#true} assume 0 == ~mode1~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,727 INFO L280 TraceCheckUtils]: 8: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,727 INFO L280 TraceCheckUtils]: 9: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st2~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send2~0 == ~id2~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,729 INFO L280 TraceCheckUtils]: 11: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode2~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,729 INFO L280 TraceCheckUtils]: 12: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,730 INFO L280 TraceCheckUtils]: 13: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,730 INFO L280 TraceCheckUtils]: 14: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send3~0 == ~id3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,731 INFO L280 TraceCheckUtils]: 15: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode3~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,742 INFO L280 TraceCheckUtils]: 16: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,743 INFO L280 TraceCheckUtils]: 17: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,744 INFO L280 TraceCheckUtils]: 18: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send4~0 == ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,744 INFO L280 TraceCheckUtils]: 19: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode4~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,745 INFO L280 TraceCheckUtils]: 20: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,745 INFO L280 TraceCheckUtils]: 21: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,746 INFO L280 TraceCheckUtils]: 22: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send5~0 == ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,747 INFO L280 TraceCheckUtils]: 23: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode5~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,752 INFO L280 TraceCheckUtils]: 24: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id6~0 >= 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,753 INFO L280 TraceCheckUtils]: 25: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~st6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,753 INFO L280 TraceCheckUtils]: 26: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~send6~0 == ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,754 INFO L280 TraceCheckUtils]: 27: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 == ~mode6~0 % 256; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,755 INFO L280 TraceCheckUtils]: 28: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id2~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,756 INFO L280 TraceCheckUtils]: 29: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,757 INFO L280 TraceCheckUtils]: 30: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,757 INFO L280 TraceCheckUtils]: 31: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,758 INFO L280 TraceCheckUtils]: 32: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id1~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,759 INFO L280 TraceCheckUtils]: 33: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id3~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,760 INFO L280 TraceCheckUtils]: 34: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,761 INFO L280 TraceCheckUtils]: 35: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,761 INFO L280 TraceCheckUtils]: 36: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id2~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,762 INFO L280 TraceCheckUtils]: 37: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id4~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,763 INFO L280 TraceCheckUtils]: 38: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,764 INFO L280 TraceCheckUtils]: 39: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id3~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,765 INFO L280 TraceCheckUtils]: 40: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id5~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,766 INFO L280 TraceCheckUtils]: 41: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id4~0 != ~id6~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,766 INFO L280 TraceCheckUtils]: 42: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,767 INFO L280 TraceCheckUtils]: 43: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} init_#res := init_~tmp~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,768 INFO L280 TraceCheckUtils]: 44: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,769 INFO L280 TraceCheckUtils]: 45: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !(0 == assume_abort_if_not_~cond); {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,770 INFO L280 TraceCheckUtils]: 46: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,770 INFO L280 TraceCheckUtils]: 47: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} is VALID [2020-07-29 03:17:36,772 INFO L280 TraceCheckUtils]: 48: Hoare triple {1874#(= (* 256 (div ~mode1~0 256)) ~mode1~0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,772 INFO L280 TraceCheckUtils]: 49: Hoare triple {1873#false} assume !(node1_~m1~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:17:36,772 INFO L280 TraceCheckUtils]: 50: Hoare triple {1873#false} ~mode1~0 := 0; {1873#false} is VALID [2020-07-29 03:17:36,773 INFO L280 TraceCheckUtils]: 51: Hoare triple {1873#false} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,773 INFO L280 TraceCheckUtils]: 52: Hoare triple {1873#false} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,773 INFO L280 TraceCheckUtils]: 53: Hoare triple {1873#false} assume !(node2_~m2~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:17:36,773 INFO L280 TraceCheckUtils]: 54: Hoare triple {1873#false} ~mode2~0 := 0; {1873#false} is VALID [2020-07-29 03:17:36,774 INFO L280 TraceCheckUtils]: 55: Hoare triple {1873#false} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,774 INFO L280 TraceCheckUtils]: 56: Hoare triple {1873#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,775 INFO L280 TraceCheckUtils]: 57: Hoare triple {1873#false} assume !(node3_~m3~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:17:36,775 INFO L280 TraceCheckUtils]: 58: Hoare triple {1873#false} ~mode3~0 := 0; {1873#false} is VALID [2020-07-29 03:17:36,775 INFO L280 TraceCheckUtils]: 59: Hoare triple {1873#false} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,775 INFO L280 TraceCheckUtils]: 60: Hoare triple {1873#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,775 INFO L280 TraceCheckUtils]: 61: Hoare triple {1873#false} assume !(node4_~m4~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:17:36,776 INFO L280 TraceCheckUtils]: 62: Hoare triple {1873#false} ~mode4~0 := 0; {1873#false} is VALID [2020-07-29 03:17:36,776 INFO L280 TraceCheckUtils]: 63: Hoare triple {1873#false} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,776 INFO L280 TraceCheckUtils]: 64: Hoare triple {1873#false} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,777 INFO L280 TraceCheckUtils]: 65: Hoare triple {1873#false} assume !(node5_~m5~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:17:36,777 INFO L280 TraceCheckUtils]: 66: Hoare triple {1873#false} ~mode5~0 := 0; {1873#false} is VALID [2020-07-29 03:17:36,777 INFO L280 TraceCheckUtils]: 67: Hoare triple {1873#false} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,777 INFO L280 TraceCheckUtils]: 68: Hoare triple {1873#false} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1873#false} is VALID [2020-07-29 03:17:36,777 INFO L280 TraceCheckUtils]: 69: Hoare triple {1873#false} assume !(node6_~m6~0 != ~nomsg~0); {1873#false} is VALID [2020-07-29 03:17:36,778 INFO L280 TraceCheckUtils]: 70: Hoare triple {1873#false} ~mode6~0 := 0; {1873#false} is VALID [2020-07-29 03:17:36,778 INFO L280 TraceCheckUtils]: 71: Hoare triple {1873#false} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1873#false} is VALID [2020-07-29 03:17:36,778 INFO L280 TraceCheckUtils]: 72: Hoare triple {1873#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {1873#false} is VALID [2020-07-29 03:17:36,779 INFO L280 TraceCheckUtils]: 73: Hoare triple {1873#false} assume ~r1~0 < 6;check_~tmp~1 := 1; {1873#false} is VALID [2020-07-29 03:17:36,779 INFO L280 TraceCheckUtils]: 74: Hoare triple {1873#false} check_#res := check_~tmp~1; {1873#false} is VALID [2020-07-29 03:17:36,779 INFO L280 TraceCheckUtils]: 75: Hoare triple {1873#false} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1873#false} is VALID [2020-07-29 03:17:36,779 INFO L280 TraceCheckUtils]: 76: Hoare triple {1873#false} assume !(0 == assert_~arg % 256); {1873#false} is VALID [2020-07-29 03:17:36,780 INFO L280 TraceCheckUtils]: 77: Hoare triple {1873#false} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {1873#false} is VALID [2020-07-29 03:17:36,791 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:17:36,791 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72224348] [2020-07-29 03:17:36,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:36,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:17:36,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114327200] [2020-07-29 03:17:37,346 WARN L193 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2020-07-29 03:17:37,898 WARN L193 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 134 [2020-07-29 03:17:37,920 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:37,921 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:37,921 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:37,921 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:37,921 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:17:37,921 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:37,922 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:37,922 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:37,922 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:17:37,922 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:37,922 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:38,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:17:38,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,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:17:38,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,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:17:38,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,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:17:38,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,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:17:38,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:38,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:39,113 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:17:39,695 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:17:39,952 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:39,953 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:17:39,963 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:17:39,963 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:17:39,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:17:39,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:17:40,154 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:17:40,156 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:40,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:40,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:40,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:40,156 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:17:40,157 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:40,157 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:40,157 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:40,157 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c_Iteration4_Loop [2020-07-29 03:17:40,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:40,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:40,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,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:17:40,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,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:17:40,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,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:17:40,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:40,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:41,464 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:17:41,974 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-29 03:17:42,110 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:42,116 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:17:42,137 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:17:42,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,139 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,145 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:17:42,166 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:17:42,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:42,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:42,173 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:17:42,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:42,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,200 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,201 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) [2020-07-29 03:17:42,226 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:42,228 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,228 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,228 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,228 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:42,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:42,245 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) [2020-07-29 03:17:42,294 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:17:42,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:42,303 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:17:42,333 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:17:42,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,334 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,336 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:17:42,361 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:17:42,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:42,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:42,367 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:17:42,391 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:17:42,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,392 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 03:17:42,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,397 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 03:17:42,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,400 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:17:42,422 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:17:42,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:42,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:42,428 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:17:42,450 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:17:42,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,452 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,452 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,452 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,456 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:17:42,479 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:17:42,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,482 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:42,482 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:42,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:42,510 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:17:42,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,512 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,514 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:17:42,542 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:17:42,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,545 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,547 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:17:42,577 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:17:42,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,579 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,581 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:17:42,602 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:17:42,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,605 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:17:42,628 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:17:42,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,632 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:42,632 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:42,636 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:17:42,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:17:42,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,672 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:17:42,694 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:17:42,696 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,696 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,697 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,697 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:42,724 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:17:42,725 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:42,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:42,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:42,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:42,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:42,726 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:42,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:42,728 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:17:42,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:17:42,735 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:42,738 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:17:42,738 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:17:42,739 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:17:42,739 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2020-07-29 03:17:42,767 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:17:42,774 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0;" "assume !(node1_~m1~0 != ~nomsg~0);" "~mode1~0 := 0;" "havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0 != ~nomsg~0);" "~mode2~0 := 0;" "havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0 != ~nomsg~0);" "~mode3~0 := 0;" "havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0 != ~nomsg~0);" "~mode4~0 := 0;" "havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0 != ~nomsg~0);" "~mode5~0 := 0;" "havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0;" "assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node6_~m6~0 != ~nomsg~0);" "~mode6~0 := 0;" "~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1;" "assume ~r1~0 < 6;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg;" "assume !(0 == assert_~arg % 256);" "main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45;" [2020-07-29 03:17:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:42,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:42,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:17:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:42,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:42,948 INFO L280 TraceCheckUtils]: 0: Hoare triple {1875#unseeded} ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; {1875#unseeded} is VALID [2020-07-29 03:17:42,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {1875#unseeded} havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id1~0 := main_#t~nondet13;havoc main_#t~nondet13;~st1~0 := main_#t~nondet14;havoc main_#t~nondet14;~send1~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode1~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive1~0 := main_#t~nondet17;havoc main_#t~nondet17;~id2~0 := main_#t~nondet18;havoc main_#t~nondet18;~st2~0 := main_#t~nondet19;havoc main_#t~nondet19;~send2~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode2~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive3~0 := main_#t~nondet27;havoc main_#t~nondet27;~id4~0 := main_#t~nondet28;havoc main_#t~nondet28;~st4~0 := main_#t~nondet29;havoc main_#t~nondet29;~send4~0 := main_#t~nondet30;havoc main_#t~nondet30;~mode4~0 := main_#t~nondet31;havoc main_#t~nondet31;~alive4~0 := main_#t~nondet32;havoc main_#t~nondet32;~id5~0 := main_#t~nondet33;havoc main_#t~nondet33;~st5~0 := main_#t~nondet34;havoc main_#t~nondet34;~send5~0 := main_#t~nondet35;havoc main_#t~nondet35;~mode5~0 := main_#t~nondet36;havoc main_#t~nondet36;~alive5~0 := main_#t~nondet37;havoc main_#t~nondet37;~id6~0 := main_#t~nondet38;havoc main_#t~nondet38;~st6~0 := main_#t~nondet39;havoc main_#t~nondet39;~send6~0 := main_#t~nondet40;havoc main_#t~nondet40;~mode6~0 := main_#t~nondet41;havoc main_#t~nondet41;~alive6~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,950 INFO L280 TraceCheckUtils]: 2: Hoare triple {1875#unseeded} assume 0 == ~r1~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,951 INFO L280 TraceCheckUtils]: 3: Hoare triple {1875#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; {1875#unseeded} is VALID [2020-07-29 03:17:42,951 INFO L280 TraceCheckUtils]: 4: Hoare triple {1875#unseeded} assume ~id1~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:17:42,952 INFO L280 TraceCheckUtils]: 5: Hoare triple {1875#unseeded} assume 0 == ~st1~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,952 INFO L280 TraceCheckUtils]: 6: Hoare triple {1875#unseeded} assume ~send1~0 == ~id1~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,953 INFO L280 TraceCheckUtils]: 7: Hoare triple {1875#unseeded} assume 0 == ~mode1~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:17:42,954 INFO L280 TraceCheckUtils]: 8: Hoare triple {1875#unseeded} assume ~id2~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:17:42,954 INFO L280 TraceCheckUtils]: 9: Hoare triple {1875#unseeded} assume 0 == ~st2~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,955 INFO L280 TraceCheckUtils]: 10: Hoare triple {1875#unseeded} assume ~send2~0 == ~id2~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {1875#unseeded} assume 0 == ~mode2~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:17:42,956 INFO L280 TraceCheckUtils]: 12: Hoare triple {1875#unseeded} assume ~id3~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:17:42,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {1875#unseeded} assume 0 == ~st3~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,957 INFO L280 TraceCheckUtils]: 14: Hoare triple {1875#unseeded} assume ~send3~0 == ~id3~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,958 INFO L280 TraceCheckUtils]: 15: Hoare triple {1875#unseeded} assume 0 == ~mode3~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:17:42,959 INFO L280 TraceCheckUtils]: 16: Hoare triple {1875#unseeded} assume ~id4~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:17:42,960 INFO L280 TraceCheckUtils]: 17: Hoare triple {1875#unseeded} assume 0 == ~st4~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,960 INFO L280 TraceCheckUtils]: 18: Hoare triple {1875#unseeded} assume ~send4~0 == ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,964 INFO L280 TraceCheckUtils]: 19: Hoare triple {1875#unseeded} assume 0 == ~mode4~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:17:42,978 INFO L280 TraceCheckUtils]: 20: Hoare triple {1875#unseeded} assume ~id5~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:17:42,985 INFO L280 TraceCheckUtils]: 21: Hoare triple {1875#unseeded} assume 0 == ~st5~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,986 INFO L280 TraceCheckUtils]: 22: Hoare triple {1875#unseeded} assume ~send5~0 == ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:17:42,993 INFO L280 TraceCheckUtils]: 23: Hoare triple {1875#unseeded} assume 0 == ~mode5~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:17:42,997 INFO L280 TraceCheckUtils]: 24: Hoare triple {1875#unseeded} assume ~id6~0 >= 0; {1875#unseeded} is VALID [2020-07-29 03:17:42,999 INFO L280 TraceCheckUtils]: 25: Hoare triple {1875#unseeded} assume 0 == ~st6~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,001 INFO L280 TraceCheckUtils]: 26: Hoare triple {1875#unseeded} assume ~send6~0 == ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,003 INFO L280 TraceCheckUtils]: 27: Hoare triple {1875#unseeded} assume 0 == ~mode6~0 % 256; {1875#unseeded} is VALID [2020-07-29 03:17:43,004 INFO L280 TraceCheckUtils]: 28: Hoare triple {1875#unseeded} assume ~id1~0 != ~id2~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,004 INFO L280 TraceCheckUtils]: 29: Hoare triple {1875#unseeded} assume ~id1~0 != ~id3~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,005 INFO L280 TraceCheckUtils]: 30: Hoare triple {1875#unseeded} assume ~id1~0 != ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,006 INFO L280 TraceCheckUtils]: 31: Hoare triple {1875#unseeded} assume ~id1~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,007 INFO L280 TraceCheckUtils]: 32: Hoare triple {1875#unseeded} assume ~id1~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,008 INFO L280 TraceCheckUtils]: 33: Hoare triple {1875#unseeded} assume ~id2~0 != ~id3~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,008 INFO L280 TraceCheckUtils]: 34: Hoare triple {1875#unseeded} assume ~id2~0 != ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,009 INFO L280 TraceCheckUtils]: 35: Hoare triple {1875#unseeded} assume ~id2~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,009 INFO L280 TraceCheckUtils]: 36: Hoare triple {1875#unseeded} assume ~id2~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,010 INFO L280 TraceCheckUtils]: 37: Hoare triple {1875#unseeded} assume ~id3~0 != ~id4~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,010 INFO L280 TraceCheckUtils]: 38: Hoare triple {1875#unseeded} assume ~id3~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,011 INFO L280 TraceCheckUtils]: 39: Hoare triple {1875#unseeded} assume ~id3~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,011 INFO L280 TraceCheckUtils]: 40: Hoare triple {1875#unseeded} assume ~id4~0 != ~id5~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,012 INFO L280 TraceCheckUtils]: 41: Hoare triple {1875#unseeded} assume ~id4~0 != ~id6~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,013 INFO L280 TraceCheckUtils]: 42: Hoare triple {1875#unseeded} assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; {1875#unseeded} is VALID [2020-07-29 03:17:43,013 INFO L280 TraceCheckUtils]: 43: Hoare triple {1875#unseeded} init_#res := init_~tmp~0; {1875#unseeded} is VALID [2020-07-29 03:17:43,013 INFO L280 TraceCheckUtils]: 44: Hoare triple {1875#unseeded} main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; {1875#unseeded} is VALID [2020-07-29 03:17:43,014 INFO L280 TraceCheckUtils]: 45: Hoare triple {1875#unseeded} assume !(0 == assume_abort_if_not_~cond); {1875#unseeded} is VALID [2020-07-29 03:17:43,014 INFO L280 TraceCheckUtils]: 46: Hoare triple {1875#unseeded} ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; {1875#unseeded} is VALID [2020-07-29 03:17:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:43,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:17:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:43,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:43,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {1878#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23))} assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_#t~ite1, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,160 INFO L280 TraceCheckUtils]: 2: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node1_~m1~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,160 INFO L280 TraceCheckUtils]: 3: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite2, node2_#t~ite3, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,163 INFO L280 TraceCheckUtils]: 6: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,164 INFO L280 TraceCheckUtils]: 7: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite4, node3_#t~ite5, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,165 INFO L280 TraceCheckUtils]: 9: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,166 INFO L280 TraceCheckUtils]: 11: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,167 INFO L280 TraceCheckUtils]: 12: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite6, node4_#t~ite7, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,168 INFO L280 TraceCheckUtils]: 13: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,169 INFO L280 TraceCheckUtils]: 14: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,169 INFO L280 TraceCheckUtils]: 15: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,170 INFO L280 TraceCheckUtils]: 16: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node5_#t~ite8, node5_#t~ite9, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,171 INFO L280 TraceCheckUtils]: 17: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,172 INFO L280 TraceCheckUtils]: 18: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node5_~m5~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,174 INFO L280 TraceCheckUtils]: 19: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode5~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,179 INFO L280 TraceCheckUtils]: 20: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node6_#t~ite10, node6_#t~ite11, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,180 INFO L280 TraceCheckUtils]: 21: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,181 INFO L280 TraceCheckUtils]: 22: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node6_~m6~0 != ~nomsg~0); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,182 INFO L280 TraceCheckUtils]: 23: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode6~0 := 0; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,183 INFO L280 TraceCheckUtils]: 24: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,184 INFO L280 TraceCheckUtils]: 25: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,185 INFO L280 TraceCheckUtils]: 26: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 6;check_~tmp~1 := 1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,185 INFO L280 TraceCheckUtils]: 27: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,186 INFO L280 TraceCheckUtils]: 28: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,187 INFO L280 TraceCheckUtils]: 29: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:43,188 INFO L280 TraceCheckUtils]: 30: Hoare triple {2031#(and (< ULTIMATE.start_main_~i2~0 12) (<= 23 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; {1888#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 23)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:17:43,189 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:17:43,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:43,229 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:43,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,236 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:17:43,237 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56 Second operand 3 states. [2020-07-29 03:17:43,774 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 139 states and 194 transitions. cyclomatic complexity: 56. Second operand 3 states. Result 231 states and 342 transitions. Complement of second has 4 states. [2020-07-29 03:17:43,774 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:17:43,774 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:43,774 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2020-07-29 03:17:43,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:43,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:43,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:17:43,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:43,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:43,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:43,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. [2020-07-29 03:17:43,792 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:43,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:43,796 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 139 states and 194 transitions. cyclomatic complexity: 56 [2020-07-29 03:17:43,876 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 92 examples of accepted words. [2020-07-29 03:17:43,876 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:17:43,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:43,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:17:43,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2020-07-29 03:17:43,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2020-07-29 03:17:43,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:43,881 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:17:43,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:43,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 231 letters. Loop has 231 letters. [2020-07-29 03:17:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 231 letters. Loop has 231 letters. [2020-07-29 03:17:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 231 letters. Loop has 231 letters. [2020-07-29 03:17:43,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 139 letters. Loop has 139 letters. [2020-07-29 03:17:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 139 letters. Loop has 139 letters. [2020-07-29 03:17:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 139 letters. Loop has 139 letters. [2020-07-29 03:17:43,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:43,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:43,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:43,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:17:43,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:17:43,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:17:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:17:43,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:17:43,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 31 letters. [2020-07-29 03:17:43,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:17:43,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:17:43,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 31 letters. [2020-07-29 03:17:43,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:17:43,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:17:43,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 31 letters. [2020-07-29 03:17:43,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:17:43,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:17:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 31 letters. [2020-07-29 03:17:43,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:17:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:17:43,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 33 letters. [2020-07-29 03:17:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:17:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:17:43,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:17:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:17:43,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:17:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 32 letters. [2020-07-29 03:17:43,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:17:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:17:43,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:17:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:17:43,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:17:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 33 letters. [2020-07-29 03:17:43,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:17:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:17:43,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 77 letters. Loop has 31 letters. [2020-07-29 03:17:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:43,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:17:43,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:17:43,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:17:43,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:17:43,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:17:43,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:17:43,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:17:43,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:17:43,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:17:43,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:43,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:43,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:43,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:17:43,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:17:43,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:17:43,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 32 letters. [2020-07-29 03:17:43,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 32 letters. [2020-07-29 03:17:43,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 32 letters. [2020-07-29 03:17:43,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:17:43,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:17:43,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:17:43,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:17:43,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:17:43,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:17:43,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:17:43,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:17:43,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 61 letters. Loop has 31 letters. [2020-07-29 03:17:43,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:17:43,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:17:43,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 31 letters. [2020-07-29 03:17:43,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:17:43,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:17:43,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 56 letters. Loop has 34 letters. [2020-07-29 03:17:43,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:17:43,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:17:43,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 32 letters. [2020-07-29 03:17:43,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:17:43,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:17:43,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 32 letters. [2020-07-29 03:17:43,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:17:43,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:17:43,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 33 letters. [2020-07-29 03:17:43,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:43,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:43,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:43,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:43,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:43,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:43,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:17:43,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:17:43,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 34 letters. [2020-07-29 03:17:43,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:17:43,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:17:43,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 48 letters. Loop has 31 letters. [2020-07-29 03:17:43,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:17:43,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:17:43,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 32 letters. [2020-07-29 03:17:43,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:17:43,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:17:43,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 31 letters. [2020-07-29 03:17:43,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:43,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:43,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:43,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:17:43,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:17:43,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:17:43,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:17:43,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:17:43,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 32 letters. [2020-07-29 03:17:43,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:17:43,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:17:43,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 31 letters. [2020-07-29 03:17:43,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:43,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:43,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:43,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:17:43,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:17:43,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 58 letters. Loop has 31 letters. [2020-07-29 03:17:43,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:17:43,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:17:43,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 32 letters. [2020-07-29 03:17:43,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:17:43,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:17:43,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 33 letters. [2020-07-29 03:17:43,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:17:43,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:17:43,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 69 letters. Loop has 31 letters. [2020-07-29 03:17:43,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:17:43,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:17:43,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 32 letters. [2020-07-29 03:17:43,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:17:43,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:17:43,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 57 letters. Loop has 31 letters. [2020-07-29 03:17:43,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:17:43,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:17:43,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 33 letters. [2020-07-29 03:17:43,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:17:43,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:17:43,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 32 letters. [2020-07-29 03:17:43,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:17:43,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:17:43,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 33 letters. [2020-07-29 03:17:43,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:43,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:43,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:43,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:43,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:43,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:43,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:17:43,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:17:43,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 70 letters. Loop has 31 letters. [2020-07-29 03:17:43,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:17:43,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:17:43,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 75 letters. Loop has 31 letters. [2020-07-29 03:17:43,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:17:43,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:17:43,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 76 letters. Loop has 31 letters. [2020-07-29 03:17:43,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:43,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:43,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 33 letters. [2020-07-29 03:17:43,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 32 letters. [2020-07-29 03:17:43,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 32 letters. [2020-07-29 03:17:43,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 32 letters. [2020-07-29 03:17:43,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:17:43,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:17:43,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 73 letters. Loop has 31 letters. [2020-07-29 03:17:43,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:17:43,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:17:43,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 31 letters. [2020-07-29 03:17:43,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:17:43,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:17:43,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 74 letters. Loop has 32 letters. [2020-07-29 03:17:43,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:17:43,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:17:43,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 34 letters. [2020-07-29 03:17:43,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:43,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:43,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 64 letters. Loop has 34 letters. [2020-07-29 03:17:43,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:17:43,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:17:43,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 32 letters. [2020-07-29 03:17:43,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:17:43,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:17:43,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 34 letters. [2020-07-29 03:17:43,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:17:43,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:17:43,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 33 letters. [2020-07-29 03:17:43,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:17:43,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:17:43,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 34 letters. [2020-07-29 03:17:43,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:17:43,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:43,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:17:43,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 55 letters. Loop has 31 letters. [2020-07-29 03:17:44,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 51 letters. Loop has 34 letters. [2020-07-29 03:17:44,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 34 letters. [2020-07-29 03:17:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 51 letters. Loop has 34 letters. [2020-07-29 03:17:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:17:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:17:44,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 65 letters. Loop has 31 letters. [2020-07-29 03:17:44,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 32 letters. [2020-07-29 03:17:44,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:17:44,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:17:44,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 66 letters. Loop has 31 letters. [2020-07-29 03:17:44,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:17:44,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:17:44,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 31 letters. [2020-07-29 03:17:44,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:17:44,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:17:44,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 31 letters. [2020-07-29 03:17:44,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:44,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:44,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 32 letters. [2020-07-29 03:17:44,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:17:44,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:17:44,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 33 letters. [2020-07-29 03:17:44,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:17:44,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:17:44,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 53 letters. Loop has 32 letters. [2020-07-29 03:17:44,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:17:44,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:17:44,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 54 letters. Loop has 33 letters. [2020-07-29 03:17:44,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:17:44,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:17:44,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 33 letters. [2020-07-29 03:17:44,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:17:44,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:17:44,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:17:44,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:44,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:44,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 33 letters. [2020-07-29 03:17:44,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:17:44,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:17:44,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 31 letters. [2020-07-29 03:17:44,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:17:44,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:17:44,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 67 letters. Loop has 31 letters. [2020-07-29 03:17:44,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:17:44,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:17:44,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 49 letters. Loop has 31 letters. [2020-07-29 03:17:44,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:17:44,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:17:44,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 32 letters. [2020-07-29 03:17:44,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:17:44,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:17:44,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 50 letters. Loop has 31 letters. [2020-07-29 03:17:44,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:17:44,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:17:44,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 34 letters. [2020-07-29 03:17:44,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:44,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:44,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 72 letters. Loop has 34 letters. [2020-07-29 03:17:44,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:44,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:44,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 60 letters. Loop has 34 letters. [2020-07-29 03:17:44,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:17:44,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:17:44,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 32 letters. [2020-07-29 03:17:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:17:44,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:17:44,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 52 letters. Loop has 31 letters. [2020-07-29 03:17:44,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:17:44,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:17:44,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 63 letters. Loop has 31 letters. [2020-07-29 03:17:44,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:17:44,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:17:44,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 71 letters. Loop has 32 letters. [2020-07-29 03:17:44,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:17:44,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:17:44,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 59 letters. Loop has 34 letters. [2020-07-29 03:17:44,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:17:44,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:17:44,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 62 letters. Loop has 32 letters. [2020-07-29 03:17:44,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:17:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:17:44,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 34 letters. [2020-07-29 03:17:44,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:17:44,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:17:44,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 68 letters. Loop has 31 letters. [2020-07-29 03:17:44,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 139 states and 194 transitions. cyclomatic complexity: 56 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:44,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:44,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 231 states and 342 transitions. cyclomatic complexity: 112 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:44,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,046 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:44,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:17:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2020-07-29 03:17:44,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 31 letters. [2020-07-29 03:17:44,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 78 letters. Loop has 31 letters. [2020-07-29 03:17:44,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 194 transitions. Stem has 47 letters. Loop has 62 letters. [2020-07-29 03:17:44,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:44,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 231 states and 342 transitions. cyclomatic complexity: 112 [2020-07-29 03:17:44,061 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:44,061 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 231 states to 0 states and 0 transitions. [2020-07-29 03:17:44,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:44,061 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:44,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:44,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:44,061 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:44,061 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:44,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:44,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:17:44,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:17:44,062 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:17:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:44,063 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:17:44,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:44,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:44,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:44,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:17:44,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:44,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:17:44,168 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:44,168 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:44,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:44,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:44,168 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:44,168 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:44,168 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:44,168 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:17:44,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:17:44,169 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:44,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:44,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:17:44 BoogieIcfgContainer [2020-07-29 03:17:44,176 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:17:44,176 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:17:44,176 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:17:44,176 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:17:44,177 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:17:33" (3/4) ... [2020-07-29 03:17:44,181 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:17:44,181 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:17:44,183 INFO L168 Benchmark]: Toolchain (without parser) took 12839.20 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 417.9 MB). Free memory was 954.9 MB in the beginning and 1.3 GB in the end (delta: -303.2 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:44,184 INFO L168 Benchmark]: CDTParser took 0.42 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:17:44,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 576.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:44,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.98 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:17:44,190 INFO L168 Benchmark]: Boogie Preprocessor took 68.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:44,190 INFO L168 Benchmark]: RCFGBuilder took 1191.54 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: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:44,191 INFO L168 Benchmark]: BuchiAutomizer took 10886.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 272.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -235.9 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:44,191 INFO L168 Benchmark]: Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:44,200 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.42 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 576.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -172.0 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1191.54 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: 98.0 MB). Peak memory consumption was 98.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10886.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 272.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -235.9 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.85 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.4s. Construction of modules took 0.0s. 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 139 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 863 SDtfs, 314 SDslu, 1382 SDs, 0 SdLazy, 26 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital189 mio100 ax138 hnf108 lsp26 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...