./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a766b0b10aa8aa3e6a546f9ddbfa4db6a51be366 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:16:55,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:16:55,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:16:55,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:16:55,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:16:55,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:16:55,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:16:55,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:16:55,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:16:55,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:16:55,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:16:55,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:16:55,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:16:55,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:16:55,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:16:55,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:16:55,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:16:55,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:16:55,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:16:55,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:16:55,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:16:55,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:16:55,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:16:55,854 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:16:55,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:16:55,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:16:55,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:16:55,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:16:55,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:16:55,863 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:16:55,863 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:16:55,864 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:16:55,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:16:55,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:16:55,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:16:55,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:16:55,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:16:55,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:16:55,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:16:55,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:16:55,878 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:16:55,879 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:16:55,905 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:16:55,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:16:55,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:16:55,908 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:16:55,908 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:16:55,908 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:16:55,909 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:16:55,909 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:16:55,909 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:16:55,910 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:16:55,911 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:16:55,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:16:55,911 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:16:55,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:16:55,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:16:55,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:16:55,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:16:55,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:16:55,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:16:55,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:16:55,914 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:16:55,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:16:55,914 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:16:55,915 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:16:55,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:16:55,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:16:55,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:16:55,916 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:16:55,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:16:55,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:16:55,917 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:16:55,918 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:16:55,919 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:16:55,920 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 -> a766b0b10aa8aa3e6a546f9ddbfa4db6a51be366 [2020-07-29 03:16:56,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:16:56,227 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:16:56,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:16:56,233 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:16:56,233 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:16:56,234 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.4.2.ufo.BOUNDED-8.pals.c [2020-07-29 03:16:56,302 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928d8654/78be39dea9f541b4bdf24eb5e96a1bfa/FLAG7ba2c46b8 [2020-07-29 03:16:56,755 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:16:56,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2020-07-29 03:16:56,766 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928d8654/78be39dea9f541b4bdf24eb5e96a1bfa/FLAG7ba2c46b8 [2020-07-29 03:16:57,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928d8654/78be39dea9f541b4bdf24eb5e96a1bfa [2020-07-29 03:16:57,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:16:57,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:16:57,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:16:57,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:16:57,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:16:57,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411a7908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57, skipping insertion in model container [2020-07-29 03:16:57,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:16:57,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:16:57,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:16:57,434 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:16:57,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:16:57,570 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:16:57,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57 WrapperNode [2020-07-29 03:16:57,571 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:16:57,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:16:57,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:16:57,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:16:57,584 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:16:57" (1/1) ... [2020-07-29 03:16:57,595 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:16:57" (1/1) ... [2020-07-29 03:16:57,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:16:57,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:16:57,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:16:57,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:16:57,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,683 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (1/1) ... [2020-07-29 03:16:57,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:16:57,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:16:57,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:16:57,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:16:57,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (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:16:57,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:16:57,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:16:58,593 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:16:58,594 INFO L295 CfgBuilder]: Removed 19 assume(true) statements. [2020-07-29 03:16:58,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:16:58 BoogieIcfgContainer [2020-07-29 03:16:58,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:16:58,607 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:16:58,607 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:16:58,611 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:16:58,612 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:16:58,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:16:57" (1/3) ... [2020-07-29 03:16:58,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47501f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:16:58, skipping insertion in model container [2020-07-29 03:16:58,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:16:58,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:16:57" (2/3) ... [2020-07-29 03:16:58,615 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47501f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:16:58, skipping insertion in model container [2020-07-29 03:16:58,615 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:16:58,616 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:16:58" (3/3) ... [2020-07-29 03:16:58,617 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c [2020-07-29 03:16:58,665 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:16:58,665 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:16:58,665 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:16:58,665 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:16:58,666 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:16:58,666 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:16:58,666 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:16:58,666 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:16:58,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states. [2020-07-29 03:16:58,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-07-29 03:16:58,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:16:58,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:16:58,742 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:16:58,742 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:16:58,742 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:16:58,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states. [2020-07-29 03:16:58,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-07-29 03:16:58,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:16:58,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:16:58,759 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:16:58,759 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:16:58,768 INFO L794 eck$LassoCheckResult]: Stem: 37#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;~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]; 11#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 84#L244true assume !(0 == ~r1~0);init_~tmp~0 := 0; 82#L244-1true init_#res := init_~tmp~0; 58#L341true main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 62#L393true assume !(0 == main_~i2~0); 69#L393-2true ~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;main_~i2~0 := 0; 44#L403-2true [2020-07-29 03:16:58,769 INFO L796 eck$LassoCheckResult]: Loop: 44#L403-2true assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 49#L110true assume !(0 != ~mode1~0 % 256); 38#L128true assume !(0 != ~alive1~0 % 256); 10#L128-2true ~mode1~0 := 1; 43#L110-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 23#L142true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 80#L145true assume !(node2_~m2~0 != ~nomsg~0); 77#L145-1true ~mode2~0 := 0; 16#L142-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 26#L176true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 9#L179true assume !(node3_~m3~0 != ~nomsg~0); 8#L179-1true ~mode3~0 := 0; 50#L176-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 56#L210true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 63#L213true assume !(node4_~m4~0 != ~nomsg~0); 34#L213-1true ~mode4~0 := 0; 55#L210-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 66#L349true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 70#L349-1true check_#res := check_~tmp~1; 87#L361true main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 76#L430true assume !(0 == assert_~arg % 256); 35#L425true main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 44#L403-2true [2020-07-29 03:16:58,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:16:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2020-07-29 03:16:58,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:16:58,782 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754186032] [2020-07-29 03:16:58,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:16:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:16:59,056 INFO L280 TraceCheckUtils]: 0: Hoare triple {100#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;~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]; {100#true} is VALID [2020-07-29 03:16:59,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {100#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {100#true} is VALID [2020-07-29 03:16:59,059 INFO L280 TraceCheckUtils]: 2: Hoare triple {100#true} assume !(0 == ~r1~0);init_~tmp~0 := 0; {102#(= ULTIMATE.start_init_~tmp~0 0)} is VALID [2020-07-29 03:16:59,060 INFO L280 TraceCheckUtils]: 3: Hoare triple {102#(= ULTIMATE.start_init_~tmp~0 0)} init_#res := init_~tmp~0; {103#(= 0 |ULTIMATE.start_init_#res|)} is VALID [2020-07-29 03:16:59,061 INFO L280 TraceCheckUtils]: 4: Hoare triple {103#(= 0 |ULTIMATE.start_init_#res|)} main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; {104#(= 0 ULTIMATE.start_main_~i2~0)} is VALID [2020-07-29 03:16:59,062 INFO L280 TraceCheckUtils]: 5: Hoare triple {104#(= 0 ULTIMATE.start_main_~i2~0)} assume !(0 == main_~i2~0); {101#false} is VALID [2020-07-29 03:16:59,063 INFO L280 TraceCheckUtils]: 6: Hoare triple {101#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;main_~i2~0 := 0; {101#false} is VALID [2020-07-29 03:16:59,067 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:16:59,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754186032] [2020-07-29 03:16:59,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:16:59,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:16:59,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522948168] [2020-07-29 03:16:59,080 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:16:59,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:16:59,082 INFO L82 PathProgramCache]: Analyzing trace with hash -2060736893, now seen corresponding path program 1 times [2020-07-29 03:16:59,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:16:59,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565504246] [2020-07-29 03:16:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:16:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:16:59,359 INFO L280 TraceCheckUtils]: 0: Hoare triple {105#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {105#true} assume !(0 != ~mode1~0 % 256); {105#true} is VALID [2020-07-29 03:16:59,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {105#true} assume !(0 != ~alive1~0 % 256); {105#true} is VALID [2020-07-29 03:16:59,360 INFO L280 TraceCheckUtils]: 3: Hoare triple {105#true} ~mode1~0 := 1; {105#true} is VALID [2020-07-29 03:16:59,361 INFO L280 TraceCheckUtils]: 4: Hoare triple {105#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,361 INFO L280 TraceCheckUtils]: 5: Hoare triple {105#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {105#true} assume !(node2_~m2~0 != ~nomsg~0); {105#true} is VALID [2020-07-29 03:16:59,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {105#true} ~mode2~0 := 0; {105#true} is VALID [2020-07-29 03:16:59,363 INFO L280 TraceCheckUtils]: 8: Hoare triple {105#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,363 INFO L280 TraceCheckUtils]: 9: Hoare triple {105#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,364 INFO L280 TraceCheckUtils]: 10: Hoare triple {105#true} assume !(node3_~m3~0 != ~nomsg~0); {105#true} is VALID [2020-07-29 03:16:59,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {105#true} ~mode3~0 := 0; {105#true} is VALID [2020-07-29 03:16:59,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {105#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,365 INFO L280 TraceCheckUtils]: 13: Hoare triple {105#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {105#true} is VALID [2020-07-29 03:16:59,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {105#true} assume !(node4_~m4~0 != ~nomsg~0); {105#true} is VALID [2020-07-29 03:16:59,366 INFO L280 TraceCheckUtils]: 15: Hoare triple {105#true} ~mode4~0 := 0; {105#true} is VALID [2020-07-29 03:16:59,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {105#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {105#true} is VALID [2020-07-29 03:16:59,368 INFO L280 TraceCheckUtils]: 17: Hoare triple {105#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; {107#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:16:59,369 INFO L280 TraceCheckUtils]: 18: Hoare triple {107#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {108#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:16:59,371 INFO L280 TraceCheckUtils]: 19: Hoare triple {108#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {109#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:16:59,373 INFO L280 TraceCheckUtils]: 20: Hoare triple {109#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {106#false} is VALID [2020-07-29 03:16:59,373 INFO L280 TraceCheckUtils]: 21: Hoare triple {106#false} main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; {106#false} is VALID [2020-07-29 03:16:59,378 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:16:59,382 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565504246] [2020-07-29 03:16:59,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:16:59,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:16:59,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303240966] [2020-07-29 03:16:59,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:16:59,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:16:59,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:16:59,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:16:59,408 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 5 states. [2020-07-29 03:17:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:00,066 INFO L93 Difference]: Finished difference Result 161 states and 258 transitions. [2020-07-29 03:17:00,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:17:00,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:00,083 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:00,086 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 161 states and 258 transitions. [2020-07-29 03:17:00,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-07-29 03:17:00,115 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 161 states to 152 states and 226 transitions. [2020-07-29 03:17:00,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2020-07-29 03:17:00,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2020-07-29 03:17:00,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 152 states and 226 transitions. [2020-07-29 03:17:00,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:00,120 INFO L688 BuchiCegarLoop]: Abstraction has 152 states and 226 transitions. [2020-07-29 03:17:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 226 transitions. [2020-07-29 03:17:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 91. [2020-07-29 03:17:00,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:00,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states and 226 transitions. Second operand 91 states. [2020-07-29 03:17:00,160 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states and 226 transitions. Second operand 91 states. [2020-07-29 03:17:00,162 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand 91 states. [2020-07-29 03:17:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:00,172 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2020-07-29 03:17:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2020-07-29 03:17:00,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:00,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:00,176 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 152 states and 226 transitions. [2020-07-29 03:17:00,177 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 152 states and 226 transitions. [2020-07-29 03:17:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:00,187 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2020-07-29 03:17:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2020-07-29 03:17:00,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:00,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:00,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:00,190 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:00,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-29 03:17:00,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2020-07-29 03:17:00,198 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2020-07-29 03:17:00,198 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2020-07-29 03:17:00,198 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:17:00,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2020-07-29 03:17:00,200 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-07-29 03:17:00,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:00,201 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:00,202 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] [2020-07-29 03:17:00,203 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:17:00,203 INFO L794 eck$LassoCheckResult]: Stem: 330#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;~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]; 293#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 294#L244 assume 0 == ~r1~0; 328#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 329#L246 assume ~id1~0 >= 0; 355#L247 assume 0 == ~st1~0; 309#L248 assume ~send1~0 == ~id1~0; 310#L249 assume 0 == ~mode1~0 % 256; 340#L250 assume ~id2~0 >= 0; 342#L251 assume 0 == ~st2~0; 280#L252 assume ~send2~0 == ~id2~0; 281#L253 assume 0 == ~mode2~0 % 256; 322#L254 assume ~id3~0 >= 0; 295#L255 assume 0 == ~st3~0; 296#L256 assume ~send3~0 == ~id3~0; 331#L257 assume 0 == ~mode3~0 % 256; 356#L258 assume ~id4~0 >= 0; 311#L259 assume 0 == ~st4~0; 312#L260 assume ~send4~0 == ~id4~0; 341#L261 assume 0 == ~mode4~0 % 256; 343#L262 assume ~id1~0 != ~id2~0; 282#L263 assume ~id1~0 != ~id3~0; 283#L264 assume ~id1~0 != ~id4~0; 323#L265 assume ~id2~0 != ~id3~0; 297#L266 assume ~id2~0 != ~id4~0; 298#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 335#L244-1 init_#res := init_~tmp~0; 347#L341 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 348#L393 assume !(0 == main_~i2~0); 350#L393-2 ~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;main_~i2~0 := 0; 327#L403-2 [2020-07-29 03:17:00,204 INFO L796 eck$LassoCheckResult]: Loop: 327#L403-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 336#L110 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 320#L114 assume !(node1_~m1~0 != ~nomsg~0); 319#L114-1 ~mode1~0 := 0; 292#L110-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 314#L142 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 316#L145 assume !(node2_~m2~0 != ~nomsg~0); 285#L145-1 ~mode2~0 := 0; 304#L142-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 305#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 289#L179 assume !(node3_~m3~0 != ~nomsg~0); 287#L179-1 ~mode3~0 := 0; 288#L176-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 339#L210 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 345#L213 assume !(node4_~m4~0 != ~nomsg~0); 307#L213-1 ~mode4~0 := 0; 317#L210-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 344#L349 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; 353#L349-1 check_#res := check_~tmp~1; 357#L361 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 362#L430 assume !(0 == assert_~arg % 256); 326#L425 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 327#L403-2 [2020-07-29 03:17:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2020-07-29 03:17:00,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:00,205 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852058187] [2020-07-29 03:17:00,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:00,243 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:00,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:00,343 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:00,344 INFO L82 PathProgramCache]: Analyzing trace with hash -388024983, now seen corresponding path program 1 times [2020-07-29 03:17:00,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:00,345 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298862090] [2020-07-29 03:17:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:00,519 INFO L280 TraceCheckUtils]: 0: Hoare triple {675#true} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {675#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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {675#true} assume !(node1_~m1~0 != ~nomsg~0); {675#true} is VALID [2020-07-29 03:17:00,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {675#true} ~mode1~0 := 0; {675#true} is VALID [2020-07-29 03:17:00,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {675#true} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,521 INFO L280 TraceCheckUtils]: 5: Hoare triple {675#true} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,521 INFO L280 TraceCheckUtils]: 6: Hoare triple {675#true} assume !(node2_~m2~0 != ~nomsg~0); {675#true} is VALID [2020-07-29 03:17:00,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {675#true} ~mode2~0 := 0; {675#true} is VALID [2020-07-29 03:17:00,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {675#true} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {675#true} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,522 INFO L280 TraceCheckUtils]: 10: Hoare triple {675#true} assume !(node3_~m3~0 != ~nomsg~0); {675#true} is VALID [2020-07-29 03:17:00,523 INFO L280 TraceCheckUtils]: 11: Hoare triple {675#true} ~mode3~0 := 0; {675#true} is VALID [2020-07-29 03:17:00,523 INFO L280 TraceCheckUtils]: 12: Hoare triple {675#true} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {675#true} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {675#true} is VALID [2020-07-29 03:17:00,523 INFO L280 TraceCheckUtils]: 14: Hoare triple {675#true} assume !(node4_~m4~0 != ~nomsg~0); {675#true} is VALID [2020-07-29 03:17:00,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {675#true} ~mode4~0 := 0; {675#true} is VALID [2020-07-29 03:17:00,524 INFO L280 TraceCheckUtils]: 16: Hoare triple {675#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {675#true} is VALID [2020-07-29 03:17:00,525 INFO L280 TraceCheckUtils]: 17: Hoare triple {675#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1 := 0; {677#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} is VALID [2020-07-29 03:17:00,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {677#(and (<= ULTIMATE.start_check_~tmp~1 0) (<= 0 ULTIMATE.start_check_~tmp~1))} check_#res := check_~tmp~1; {678#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} is VALID [2020-07-29 03:17:00,528 INFO L280 TraceCheckUtils]: 19: Hoare triple {678#(and (<= |ULTIMATE.start_check_#res| 0) (<= 0 |ULTIMATE.start_check_#res|))} main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {679#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} is VALID [2020-07-29 03:17:00,529 INFO L280 TraceCheckUtils]: 20: Hoare triple {679#(and (<= ULTIMATE.start_assert_~arg (* 256 (div ULTIMATE.start_assert_~arg 256))) (<= 0 ULTIMATE.start_assert_~arg))} assume !(0 == assert_~arg % 256); {676#false} is VALID [2020-07-29 03:17:00,529 INFO L280 TraceCheckUtils]: 21: Hoare triple {676#false} main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; {676#false} is VALID [2020-07-29 03:17:00,531 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:00,531 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298862090] [2020-07-29 03:17:00,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:00,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:17:00,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497868600] [2020-07-29 03:17:00,533 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 03:17:00,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:00,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:17:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:17:00,534 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 38 Second operand 5 states. [2020-07-29 03:17:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:00,946 INFO L93 Difference]: Finished difference Result 94 states and 130 transitions. [2020-07-29 03:17:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 03:17:00,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:17:00,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:00,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 130 transitions. [2020-07-29 03:17:00,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-07-29 03:17:00,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 91 states and 126 transitions. [2020-07-29 03:17:00,989 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2020-07-29 03:17:00,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2020-07-29 03:17:00,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 126 transitions. [2020-07-29 03:17:00,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:00,991 INFO L688 BuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2020-07-29 03:17:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 126 transitions. [2020-07-29 03:17:00,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2020-07-29 03:17:00,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:17:00,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 126 transitions. Second operand 91 states. [2020-07-29 03:17:00,997 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 126 transitions. Second operand 91 states. [2020-07-29 03:17:00,998 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand 91 states. [2020-07-29 03:17:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:01,002 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2020-07-29 03:17:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2020-07-29 03:17:01,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:01,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:01,003 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 91 states and 126 transitions. [2020-07-29 03:17:01,004 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 91 states and 126 transitions. [2020-07-29 03:17:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:01,008 INFO L93 Difference]: Finished difference Result 91 states and 126 transitions. [2020-07-29 03:17:01,008 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2020-07-29 03:17:01,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:17:01,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:17:01,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:17:01,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:17:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-07-29 03:17:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2020-07-29 03:17:01,014 INFO L711 BuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2020-07-29 03:17:01,014 INFO L591 BuchiCegarLoop]: Abstraction has 91 states and 126 transitions. [2020-07-29 03:17:01,014 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:17:01,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 126 transitions. [2020-07-29 03:17:01,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 61 [2020-07-29 03:17:01,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:01,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:01,017 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] [2020-07-29 03:17:01,017 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] [2020-07-29 03:17:01,018 INFO L794 eck$LassoCheckResult]: Stem: 833#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;~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]; 796#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 797#L244 assume 0 == ~r1~0; 831#L245 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 832#L246 assume ~id1~0 >= 0; 856#L247 assume 0 == ~st1~0; 812#L248 assume ~send1~0 == ~id1~0; 813#L249 assume 0 == ~mode1~0 % 256; 843#L250 assume ~id2~0 >= 0; 845#L251 assume 0 == ~st2~0; 783#L252 assume ~send2~0 == ~id2~0; 784#L253 assume 0 == ~mode2~0 % 256; 825#L254 assume ~id3~0 >= 0; 798#L255 assume 0 == ~st3~0; 799#L256 assume ~send3~0 == ~id3~0; 834#L257 assume 0 == ~mode3~0 % 256; 858#L258 assume ~id4~0 >= 0; 814#L259 assume 0 == ~st4~0; 815#L260 assume ~send4~0 == ~id4~0; 844#L261 assume 0 == ~mode4~0 % 256; 846#L262 assume ~id1~0 != ~id2~0; 785#L263 assume ~id1~0 != ~id3~0; 786#L264 assume ~id1~0 != ~id4~0; 826#L265 assume ~id2~0 != ~id3~0; 800#L266 assume ~id2~0 != ~id4~0; 801#L267 assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; 838#L244-1 init_#res := init_~tmp~0; 850#L341 main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; 851#L393 assume !(0 == main_~i2~0); 853#L393-2 ~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;main_~i2~0 := 0; 830#L403-2 [2020-07-29 03:17:01,018 INFO L796 eck$LassoCheckResult]: Loop: 830#L403-2 assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 839#L110 assume !(0 != ~mode1~0 % 256); 835#L128 assume !(0 != ~alive1~0 % 256); 794#L128-2 ~mode1~0 := 1; 795#L110-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 817#L142 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 819#L145 assume !(node2_~m2~0 != ~nomsg~0); 788#L145-1 ~mode2~0 := 0; 807#L142-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 808#L176 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 792#L179 assume !(node3_~m3~0 != ~nomsg~0); 790#L179-1 ~mode3~0 := 0; 791#L176-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 842#L210 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 848#L213 assume !(node4_~m4~0 != ~nomsg~0); 810#L213-1 ~mode4~0 := 0; 820#L210-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 847#L349 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 857#L350 assume ~r1~0 < 4;check_~tmp~1 := 1; 859#L349-1 check_#res := check_~tmp~1; 860#L361 main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 865#L430 assume !(0 == assert_~arg % 256); 829#L425 main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; 830#L403-2 [2020-07-29 03:17:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:01,019 INFO L82 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2020-07-29 03:17:01,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:01,019 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014879179] [2020-07-29 03:17:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:01,042 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:01,062 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:01,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:01,074 INFO L82 PathProgramCache]: Analyzing trace with hash 158338585, now seen corresponding path program 1 times [2020-07-29 03:17:01,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:01,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906066162] [2020-07-29 03:17:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:01,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:17:01,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:17:01,102 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:17:01,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:01,103 INFO L82 PathProgramCache]: Analyzing trace with hash 300162767, now seen corresponding path program 1 times [2020-07-29 03:17:01,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:17:01,104 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583039863] [2020-07-29 03:17:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:17:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:01,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {1058#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;~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]; {1058#true} is VALID [2020-07-29 03:17:01,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {1058#true} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1058#true} is VALID [2020-07-29 03:17:01,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {1058#true} assume 0 == ~r1~0; {1058#true} is VALID [2020-07-29 03:17:01,204 INFO L280 TraceCheckUtils]: 3: Hoare triple {1058#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1058#true} is VALID [2020-07-29 03:17:01,204 INFO L280 TraceCheckUtils]: 4: Hoare triple {1058#true} assume ~id1~0 >= 0; {1058#true} is VALID [2020-07-29 03:17:01,205 INFO L280 TraceCheckUtils]: 5: Hoare triple {1058#true} assume 0 == ~st1~0; {1058#true} is VALID [2020-07-29 03:17:01,205 INFO L280 TraceCheckUtils]: 6: Hoare triple {1058#true} assume ~send1~0 == ~id1~0; {1058#true} is VALID [2020-07-29 03:17:01,205 INFO L280 TraceCheckUtils]: 7: Hoare triple {1058#true} assume 0 == ~mode1~0 % 256; {1058#true} is VALID [2020-07-29 03:17:01,206 INFO L280 TraceCheckUtils]: 8: Hoare triple {1058#true} assume ~id2~0 >= 0; {1058#true} is VALID [2020-07-29 03:17:01,206 INFO L280 TraceCheckUtils]: 9: Hoare triple {1058#true} assume 0 == ~st2~0; {1058#true} is VALID [2020-07-29 03:17:01,206 INFO L280 TraceCheckUtils]: 10: Hoare triple {1058#true} assume ~send2~0 == ~id2~0; {1058#true} is VALID [2020-07-29 03:17:01,209 INFO L280 TraceCheckUtils]: 11: Hoare triple {1058#true} assume 0 == ~mode2~0 % 256; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,210 INFO L280 TraceCheckUtils]: 12: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 >= 0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,211 INFO L280 TraceCheckUtils]: 13: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st3~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,211 INFO L280 TraceCheckUtils]: 14: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send3~0 == ~id3~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,212 INFO L280 TraceCheckUtils]: 15: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode3~0 % 256; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,212 INFO L280 TraceCheckUtils]: 16: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id4~0 >= 0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,213 INFO L280 TraceCheckUtils]: 17: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~st4~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,213 INFO L280 TraceCheckUtils]: 18: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~send4~0 == ~id4~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,214 INFO L280 TraceCheckUtils]: 19: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 == ~mode4~0 % 256; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,215 INFO L280 TraceCheckUtils]: 20: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id2~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,216 INFO L280 TraceCheckUtils]: 21: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id3~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,216 INFO L280 TraceCheckUtils]: 22: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id1~0 != ~id4~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,217 INFO L280 TraceCheckUtils]: 23: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id3~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,217 INFO L280 TraceCheckUtils]: 24: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id2~0 != ~id4~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,218 INFO L280 TraceCheckUtils]: 25: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,221 INFO L280 TraceCheckUtils]: 26: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} init_#res := init_~tmp~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,222 INFO L280 TraceCheckUtils]: 27: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,223 INFO L280 TraceCheckUtils]: 28: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 == main_~i2~0); {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,223 INFO L280 TraceCheckUtils]: 29: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~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;main_~i2~0 := 0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,224 INFO L280 TraceCheckUtils]: 30: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,225 INFO L280 TraceCheckUtils]: 31: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~mode1~0 % 256); {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,225 INFO L280 TraceCheckUtils]: 32: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume !(0 != ~alive1~0 % 256); {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,226 INFO L280 TraceCheckUtils]: 33: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} ~mode1~0 := 1; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,227 INFO L280 TraceCheckUtils]: 34: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} is VALID [2020-07-29 03:17:01,228 INFO L280 TraceCheckUtils]: 35: Hoare triple {1060#(= (* 256 (div ~mode2~0 256)) ~mode2~0)} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1059#false} is VALID [2020-07-29 03:17:01,228 INFO L280 TraceCheckUtils]: 36: Hoare triple {1059#false} assume !(node2_~m2~0 != ~nomsg~0); {1059#false} is VALID [2020-07-29 03:17:01,228 INFO L280 TraceCheckUtils]: 37: Hoare triple {1059#false} ~mode2~0 := 0; {1059#false} is VALID [2020-07-29 03:17:01,228 INFO L280 TraceCheckUtils]: 38: Hoare triple {1059#false} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1059#false} is VALID [2020-07-29 03:17:01,229 INFO L280 TraceCheckUtils]: 39: Hoare triple {1059#false} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1059#false} is VALID [2020-07-29 03:17:01,229 INFO L280 TraceCheckUtils]: 40: Hoare triple {1059#false} assume !(node3_~m3~0 != ~nomsg~0); {1059#false} is VALID [2020-07-29 03:17:01,229 INFO L280 TraceCheckUtils]: 41: Hoare triple {1059#false} ~mode3~0 := 0; {1059#false} is VALID [2020-07-29 03:17:01,229 INFO L280 TraceCheckUtils]: 42: Hoare triple {1059#false} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1059#false} is VALID [2020-07-29 03:17:01,230 INFO L280 TraceCheckUtils]: 43: Hoare triple {1059#false} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1059#false} is VALID [2020-07-29 03:17:01,230 INFO L280 TraceCheckUtils]: 44: Hoare triple {1059#false} assume !(node4_~m4~0 != ~nomsg~0); {1059#false} is VALID [2020-07-29 03:17:01,231 INFO L280 TraceCheckUtils]: 45: Hoare triple {1059#false} ~mode4~0 := 0; {1059#false} is VALID [2020-07-29 03:17:01,231 INFO L280 TraceCheckUtils]: 46: Hoare triple {1059#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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1059#false} is VALID [2020-07-29 03:17:01,231 INFO L280 TraceCheckUtils]: 47: Hoare triple {1059#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1059#false} is VALID [2020-07-29 03:17:01,232 INFO L280 TraceCheckUtils]: 48: Hoare triple {1059#false} assume ~r1~0 < 4;check_~tmp~1 := 1; {1059#false} is VALID [2020-07-29 03:17:01,232 INFO L280 TraceCheckUtils]: 49: Hoare triple {1059#false} check_#res := check_~tmp~1; {1059#false} is VALID [2020-07-29 03:17:01,232 INFO L280 TraceCheckUtils]: 50: Hoare triple {1059#false} main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1059#false} is VALID [2020-07-29 03:17:01,233 INFO L280 TraceCheckUtils]: 51: Hoare triple {1059#false} assume !(0 == assert_~arg % 256); {1059#false} is VALID [2020-07-29 03:17:01,233 INFO L280 TraceCheckUtils]: 52: Hoare triple {1059#false} main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; {1059#false} is VALID [2020-07-29 03:17:01,239 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:01,239 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583039863] [2020-07-29 03:17:01,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:17:01,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 03:17:01,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461832952] [2020-07-29 03:17:01,532 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 104 [2020-07-29 03:17:01,799 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2020-07-29 03:17:01,815 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:01,816 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:01,816 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:01,816 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:01,816 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 03:17:01,816 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:01,816 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:01,816 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:01,817 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2020-07-29 03:17:01,817 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:01,817 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:01,879 INFO L141 MapEliminator]: 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:01,892 INFO L141 MapEliminator]: 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:01,896 INFO L141 MapEliminator]: 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:01,899 INFO L141 MapEliminator]: 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:01,904 INFO L141 MapEliminator]: 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:01,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:01,943 INFO L141 MapEliminator]: 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:01,947 INFO L141 MapEliminator]: 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:01,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:01,955 INFO L141 MapEliminator]: 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:01,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:01,965 INFO L141 MapEliminator]: 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:01,972 INFO L141 MapEliminator]: 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:01,981 INFO L141 MapEliminator]: 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:01,984 INFO L141 MapEliminator]: 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:01,992 INFO L141 MapEliminator]: 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:02,008 INFO L141 MapEliminator]: 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:02,016 INFO L141 MapEliminator]: 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:02,020 INFO L141 MapEliminator]: 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:02,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:02,032 INFO L141 MapEliminator]: 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:02,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:02,043 INFO L141 MapEliminator]: 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:02,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:02,055 INFO L141 MapEliminator]: 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:02,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:02,074 INFO L141 MapEliminator]: 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:02,079 INFO L141 MapEliminator]: 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:03,127 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:03,128 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:03,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 03:17:03,134 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:03,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 03:17:03,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 03:17:03,287 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 03:17:03,289 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:17:03,290 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:17:03,290 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:17:03,290 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:17:03,290 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:17:03,291 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:03,291 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:17:03,291 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:17:03,291 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2020-07-29 03:17:03,291 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:17:03,292 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:17:03,338 INFO L141 MapEliminator]: 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:03,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:03,357 INFO L141 MapEliminator]: 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:03,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:03,371 INFO L141 MapEliminator]: 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:03,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:03,386 INFO L141 MapEliminator]: 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:03,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:03,398 INFO L141 MapEliminator]: 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:03,402 INFO L141 MapEliminator]: 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:03,406 INFO L141 MapEliminator]: 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:03,410 INFO L141 MapEliminator]: 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:03,415 INFO L141 MapEliminator]: 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:03,419 INFO L141 MapEliminator]: 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:03,454 INFO L141 MapEliminator]: 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:03,462 INFO L141 MapEliminator]: 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:03,495 INFO L141 MapEliminator]: 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:03,504 INFO L141 MapEliminator]: 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:03,509 INFO L141 MapEliminator]: 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:03,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:03,515 INFO L141 MapEliminator]: 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:03,523 INFO L141 MapEliminator]: 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:03,527 INFO L141 MapEliminator]: 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:03,531 INFO L141 MapEliminator]: 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:03,541 INFO L141 MapEliminator]: 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:03,548 INFO L141 MapEliminator]: 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:03,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:17:03,567 INFO L141 MapEliminator]: 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:04,561 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:17:04,567 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:04,571 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:04,573 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,574 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,616 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:04,617 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,618 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,621 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:04,621 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:04,625 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:04,656 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:04,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,662 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:04,687 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:04,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,689 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:17:04,719 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:04,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,721 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,726 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:04,726 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:04,729 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04,754 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:04,757 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,757 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,758 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,764 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:04,787 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:04,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,791 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:04,791 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:04,795 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:04,819 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:04,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,823 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:04,823 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:04,826 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:04,851 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:04,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,855 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:04,879 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:04,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,884 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:04,907 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:04,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,910 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:04,936 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:04,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,939 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:17:04,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:17:04,943 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:04,968 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:04,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:04,972 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:04,995 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:04,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:17:04,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:17:04,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:17:04,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:17:04,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:17:04,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:17:04,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:17:05,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:17:05,012 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 03:17:05,012 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 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:05,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:17:05,021 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 03:17:05,021 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:17:05,022 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 15 Supporting invariants [] [2020-07-29 03:17:05,050 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 03:17:05,061 INFO L393 LassoCheck]: Loop: "assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0;" "assume !(0 != ~mode1~0 % 256);" "assume !(0 != ~alive1~0 % 256);" "~mode1~0 := 1;" "havoc node2_#t~ite1, node2_#t~ite2, 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~ite3, node3_#t~ite4, 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~ite5, node4_#t~ite6, 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;" "~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~r1~0 < 4;check_~tmp~1 := 1;" "check_#res := check_~tmp~1;" "main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;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~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30;" [2020-07-29 03:17:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:05,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:17:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:05,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:17:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:05,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:05,266 INFO L280 TraceCheckUtils]: 0: Hoare triple {1061#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;~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]; {1061#unseeded} is VALID [2020-07-29 03:17:05,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {1061#unseeded} havoc main_#res;havoc main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~ret28, main_#t~ret29, main_#t~post30, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id1~0 := main_#t~nondet8;havoc main_#t~nondet8;~st1~0 := main_#t~nondet9;havoc main_#t~nondet9;~send1~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode1~0 := main_#t~nondet11;havoc main_#t~nondet11;~alive1~0 := main_#t~nondet12;havoc main_#t~nondet12;~id2~0 := main_#t~nondet13;havoc main_#t~nondet13;~st2~0 := main_#t~nondet14;havoc main_#t~nondet14;~send2~0 := main_#t~nondet15;havoc main_#t~nondet15;~mode2~0 := main_#t~nondet16;havoc main_#t~nondet16;~alive2~0 := main_#t~nondet17;havoc main_#t~nondet17;~id3~0 := main_#t~nondet18;havoc main_#t~nondet18;~st3~0 := main_#t~nondet19;havoc main_#t~nondet19;~send3~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode3~0 := main_#t~nondet21;havoc main_#t~nondet21;~alive3~0 := main_#t~nondet22;havoc main_#t~nondet22;~id4~0 := main_#t~nondet23;havoc main_#t~nondet23;~st4~0 := main_#t~nondet24;havoc main_#t~nondet24;~send4~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode4~0 := main_#t~nondet26;havoc main_#t~nondet26;~alive4~0 := main_#t~nondet27;havoc main_#t~nondet27;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {1061#unseeded} assume 0 == ~r1~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,269 INFO L280 TraceCheckUtils]: 3: Hoare triple {1061#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1061#unseeded} is VALID [2020-07-29 03:17:05,270 INFO L280 TraceCheckUtils]: 4: Hoare triple {1061#unseeded} assume ~id1~0 >= 0; {1061#unseeded} is VALID [2020-07-29 03:17:05,271 INFO L280 TraceCheckUtils]: 5: Hoare triple {1061#unseeded} assume 0 == ~st1~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,271 INFO L280 TraceCheckUtils]: 6: Hoare triple {1061#unseeded} assume ~send1~0 == ~id1~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,272 INFO L280 TraceCheckUtils]: 7: Hoare triple {1061#unseeded} assume 0 == ~mode1~0 % 256; {1061#unseeded} is VALID [2020-07-29 03:17:05,273 INFO L280 TraceCheckUtils]: 8: Hoare triple {1061#unseeded} assume ~id2~0 >= 0; {1061#unseeded} is VALID [2020-07-29 03:17:05,273 INFO L280 TraceCheckUtils]: 9: Hoare triple {1061#unseeded} assume 0 == ~st2~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,274 INFO L280 TraceCheckUtils]: 10: Hoare triple {1061#unseeded} assume ~send2~0 == ~id2~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {1061#unseeded} assume 0 == ~mode2~0 % 256; {1061#unseeded} is VALID [2020-07-29 03:17:05,276 INFO L280 TraceCheckUtils]: 12: Hoare triple {1061#unseeded} assume ~id3~0 >= 0; {1061#unseeded} is VALID [2020-07-29 03:17:05,276 INFO L280 TraceCheckUtils]: 13: Hoare triple {1061#unseeded} assume 0 == ~st3~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,277 INFO L280 TraceCheckUtils]: 14: Hoare triple {1061#unseeded} assume ~send3~0 == ~id3~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,277 INFO L280 TraceCheckUtils]: 15: Hoare triple {1061#unseeded} assume 0 == ~mode3~0 % 256; {1061#unseeded} is VALID [2020-07-29 03:17:05,278 INFO L280 TraceCheckUtils]: 16: Hoare triple {1061#unseeded} assume ~id4~0 >= 0; {1061#unseeded} is VALID [2020-07-29 03:17:05,279 INFO L280 TraceCheckUtils]: 17: Hoare triple {1061#unseeded} assume 0 == ~st4~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,280 INFO L280 TraceCheckUtils]: 18: Hoare triple {1061#unseeded} assume ~send4~0 == ~id4~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,280 INFO L280 TraceCheckUtils]: 19: Hoare triple {1061#unseeded} assume 0 == ~mode4~0 % 256; {1061#unseeded} is VALID [2020-07-29 03:17:05,281 INFO L280 TraceCheckUtils]: 20: Hoare triple {1061#unseeded} assume ~id1~0 != ~id2~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,282 INFO L280 TraceCheckUtils]: 21: Hoare triple {1061#unseeded} assume ~id1~0 != ~id3~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,283 INFO L280 TraceCheckUtils]: 22: Hoare triple {1061#unseeded} assume ~id1~0 != ~id4~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,283 INFO L280 TraceCheckUtils]: 23: Hoare triple {1061#unseeded} assume ~id2~0 != ~id3~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,284 INFO L280 TraceCheckUtils]: 24: Hoare triple {1061#unseeded} assume ~id2~0 != ~id4~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,285 INFO L280 TraceCheckUtils]: 25: Hoare triple {1061#unseeded} assume ~id3~0 != ~id4~0;init_~tmp~0 := 1; {1061#unseeded} is VALID [2020-07-29 03:17:05,286 INFO L280 TraceCheckUtils]: 26: Hoare triple {1061#unseeded} init_#res := init_~tmp~0; {1061#unseeded} is VALID [2020-07-29 03:17:05,286 INFO L280 TraceCheckUtils]: 27: Hoare triple {1061#unseeded} main_#t~ret28 := init_#res;main_~i2~0 := main_#t~ret28;havoc main_#t~ret28; {1061#unseeded} is VALID [2020-07-29 03:17:05,287 INFO L280 TraceCheckUtils]: 28: Hoare triple {1061#unseeded} assume !(0 == main_~i2~0); {1061#unseeded} is VALID [2020-07-29 03:17:05,288 INFO L280 TraceCheckUtils]: 29: Hoare triple {1061#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;main_~i2~0 := 0; {1061#unseeded} is VALID [2020-07-29 03:17:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:05,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:17:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:17:05,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:17:05,390 INFO L280 TraceCheckUtils]: 0: Hoare triple {1064#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15))} assume !!(main_~i2~0 < 8);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~mode1~0 % 256); {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 != ~alive1~0 % 256); {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode1~0 := 1; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node2_~m2~0 != ~nomsg~0); {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,396 INFO L280 TraceCheckUtils]: 7: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode2~0 := 0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,397 INFO L280 TraceCheckUtils]: 8: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,398 INFO L280 TraceCheckUtils]: 9: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,398 INFO L280 TraceCheckUtils]: 10: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node3_~m3~0 != ~nomsg~0); {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,399 INFO L280 TraceCheckUtils]: 11: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode3~0 := 0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,402 INFO L280 TraceCheckUtils]: 14: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(node4_~m4~0 != ~nomsg~0); {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} ~mode4~0 := 0; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ 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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,405 INFO L280 TraceCheckUtils]: 18: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume ~r1~0 < 4;check_~tmp~1 := 1; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,405 INFO L280 TraceCheckUtils]: 19: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} check_#res := check_~tmp~1; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,406 INFO L280 TraceCheckUtils]: 20: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~ret29 := check_#res;main_~c1~0 := main_#t~ret29;havoc main_#t~ret29;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,407 INFO L280 TraceCheckUtils]: 21: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} assume !(0 == assert_~arg % 256); {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} is VALID [2020-07-29 03:17:05,408 INFO L280 TraceCheckUtils]: 22: Hoare triple {1166#(and (< ULTIMATE.start_main_~i2~0 8) (<= 15 (+ oldRank0 (* 2 ULTIMATE.start_main_~i2~0))))} main_#t~post30 := main_~i2~0;main_~i2~0 := 1 + main_#t~post30;havoc main_#t~post30; {1074#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i2~0) 15)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:17:05,409 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:05,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:05,443 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:05,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,449 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:05,450 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 91 states and 126 transitions. cyclomatic complexity: 36 Second operand 3 states. [2020-07-29 03:17:05,766 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 91 states and 126 transitions. cyclomatic complexity: 36. Second operand 3 states. Result 152 states and 223 transitions. Complement of second has 4 states. [2020-07-29 03:17:05,767 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:05,767 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:05,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 126 transitions. cyclomatic complexity: 36 [2020-07-29 03:17:05,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:05,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:05,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:17:05,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:05,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:17:05,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:17:05,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 223 transitions. [2020-07-29 03:17:05,782 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:05,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:05,786 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 91 states and 126 transitions. cyclomatic complexity: 36 [2020-07-29 03:17:05,838 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 61 examples of accepted words. [2020-07-29 03:17:05,838 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:17:05,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:17:05,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:17:05,842 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 152 states and 223 transitions. cyclomatic complexity: 72 [2020-07-29 03:17:05,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 152 states and 223 transitions. cyclomatic complexity: 72 [2020-07-29 03:17:05,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:05,843 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 03:17:05,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:05,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:05,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:05,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 152 letters. Loop has 152 letters. [2020-07-29 03:17:05,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 152 letters. Loop has 152 letters. [2020-07-29 03:17:05,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 152 letters. Loop has 152 letters. [2020-07-29 03:17:05,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 91 letters. Loop has 91 letters. [2020-07-29 03:17:05,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 91 letters. Loop has 91 letters. [2020-07-29 03:17:05,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 91 letters. Loop has 91 letters. [2020-07-29 03:17:05,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:05,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:05,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:17:05,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 26 letters. [2020-07-29 03:17:05,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 26 letters. [2020-07-29 03:17:05,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 26 letters. [2020-07-29 03:17:05,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 26 letters. [2020-07-29 03:17:05,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 26 letters. [2020-07-29 03:17:05,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 43 letters. Loop has 26 letters. [2020-07-29 03:17:05,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 24 letters. [2020-07-29 03:17:05,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 24 letters. [2020-07-29 03:17:05,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 24 letters. [2020-07-29 03:17:05,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 26 letters. [2020-07-29 03:17:05,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 26 letters. [2020-07-29 03:17:05,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 26 letters. [2020-07-29 03:17:05,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 24 letters. [2020-07-29 03:17:05,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 24 letters. [2020-07-29 03:17:05,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 24 letters. [2020-07-29 03:17:05,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 24 letters. [2020-07-29 03:17:05,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 24 letters. [2020-07-29 03:17:05,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 24 letters. [2020-07-29 03:17:05,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 23 letters. [2020-07-29 03:17:05,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 23 letters. [2020-07-29 03:17:05,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 23 letters. [2020-07-29 03:17:05,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:17:05,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:17:05,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:17:05,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 23 letters. [2020-07-29 03:17:05,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 23 letters. [2020-07-29 03:17:05,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 23 letters. [2020-07-29 03:17:05,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 23 letters. [2020-07-29 03:17:05,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 23 letters. [2020-07-29 03:17:05,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 23 letters. [2020-07-29 03:17:05,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 40 letters. Loop has 23 letters. [2020-07-29 03:17:05,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 23 letters. [2020-07-29 03:17:05,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 40 letters. Loop has 23 letters. [2020-07-29 03:17:05,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 24 letters. [2020-07-29 03:17:05,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 24 letters. [2020-07-29 03:17:05,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 24 letters. [2020-07-29 03:17:05,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 23 letters. [2020-07-29 03:17:05,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 23 letters. [2020-07-29 03:17:05,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 23 letters. [2020-07-29 03:17:05,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:17:05,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:17:05,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 23 letters. [2020-07-29 03:17:05,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 25 letters. [2020-07-29 03:17:05,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 25 letters. [2020-07-29 03:17:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 25 letters. [2020-07-29 03:17:05,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:17:05,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:17:05,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 25 letters. [2020-07-29 03:17:05,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 40 letters. Loop has 24 letters. [2020-07-29 03:17:05,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 40 letters. Loop has 24 letters. [2020-07-29 03:17:05,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 40 letters. Loop has 24 letters. [2020-07-29 03:17:05,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 24 letters. [2020-07-29 03:17:05,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 24 letters. [2020-07-29 03:17:05,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 24 letters. [2020-07-29 03:17:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 41 letters. Loop has 25 letters. [2020-07-29 03:17:05,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 25 letters. [2020-07-29 03:17:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 41 letters. Loop has 25 letters. [2020-07-29 03:17:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 23 letters. [2020-07-29 03:17:05,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 23 letters. [2020-07-29 03:17:05,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 23 letters. [2020-07-29 03:17:05,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 39 letters. Loop has 23 letters. [2020-07-29 03:17:05,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 23 letters. [2020-07-29 03:17:05,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 39 letters. Loop has 23 letters. [2020-07-29 03:17:05,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:17:05,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:17:05,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:17:05,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 23 letters. [2020-07-29 03:17:05,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 23 letters. [2020-07-29 03:17:05,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 23 letters. [2020-07-29 03:17:05,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 47 letters. Loop has 26 letters. [2020-07-29 03:17:05,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 26 letters. [2020-07-29 03:17:05,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 47 letters. Loop has 26 letters. [2020-07-29 03:17:05,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 24 letters. [2020-07-29 03:17:05,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 24 letters. [2020-07-29 03:17:05,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 24 letters. [2020-07-29 03:17:05,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 35 letters. Loop has 23 letters. [2020-07-29 03:17:05,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 23 letters. [2020-07-29 03:17:05,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 35 letters. Loop has 23 letters. [2020-07-29 03:17:05,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 36 letters. Loop has 24 letters. [2020-07-29 03:17:05,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 24 letters. [2020-07-29 03:17:05,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 36 letters. Loop has 24 letters. [2020-07-29 03:17:05,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 36 letters. Loop has 23 letters. [2020-07-29 03:17:05,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 36 letters. Loop has 23 letters. [2020-07-29 03:17:05,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 36 letters. Loop has 23 letters. [2020-07-29 03:17:05,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 23 letters. [2020-07-29 03:17:05,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 23 letters. [2020-07-29 03:17:05,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 23 letters. [2020-07-29 03:17:05,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 47 letters. Loop has 26 letters. [2020-07-29 03:17:05,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 26 letters. [2020-07-29 03:17:05,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 47 letters. Loop has 26 letters. [2020-07-29 03:17:05,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 23 letters. [2020-07-29 03:17:05,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 23 letters. [2020-07-29 03:17:05,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 23 letters. [2020-07-29 03:17:05,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 32 letters. Loop has 23 letters. [2020-07-29 03:17:05,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 23 letters. [2020-07-29 03:17:05,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 32 letters. Loop has 23 letters. [2020-07-29 03:17:05,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 24 letters. [2020-07-29 03:17:05,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 24 letters. [2020-07-29 03:17:05,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 24 letters. [2020-07-29 03:17:05,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 39 letters. Loop has 26 letters. [2020-07-29 03:17:05,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 26 letters. [2020-07-29 03:17:05,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 39 letters. Loop has 26 letters. [2020-07-29 03:17:05,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:17:05,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:17:05,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:17:05,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 52 letters. Loop has 23 letters. [2020-07-29 03:17:05,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 52 letters. Loop has 23 letters. [2020-07-29 03:17:05,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 52 letters. Loop has 23 letters. [2020-07-29 03:17:05,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 32 letters. Loop has 23 letters. [2020-07-29 03:17:05,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 32 letters. Loop has 23 letters. [2020-07-29 03:17:05,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 32 letters. Loop has 23 letters. [2020-07-29 03:17:05,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 33 letters. Loop has 25 letters. [2020-07-29 03:17:05,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 33 letters. Loop has 25 letters. [2020-07-29 03:17:05,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 33 letters. Loop has 25 letters. [2020-07-29 03:17:05,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:17:05,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:17:05,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 42 letters. Loop has 25 letters. [2020-07-29 03:17:05,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 31 letters. Loop has 23 letters. [2020-07-29 03:17:05,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 31 letters. Loop has 23 letters. [2020-07-29 03:17:05,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 31 letters. Loop has 23 letters. [2020-07-29 03:17:05,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 44 letters. Loop has 24 letters. [2020-07-29 03:17:05,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 24 letters. [2020-07-29 03:17:05,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 44 letters. Loop has 24 letters. [2020-07-29 03:17:05,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 25 letters. [2020-07-29 03:17:05,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 25 letters. [2020-07-29 03:17:05,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 25 letters. [2020-07-29 03:17:05,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 23 letters. [2020-07-29 03:17:05,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 23 letters. [2020-07-29 03:17:05,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 43 letters. Loop has 23 letters. [2020-07-29 03:17:05,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 47 letters. Loop has 23 letters. [2020-07-29 03:17:05,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 47 letters. Loop has 23 letters. [2020-07-29 03:17:05,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 47 letters. Loop has 23 letters. [2020-07-29 03:17:05,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 44 letters. Loop has 23 letters. [2020-07-29 03:17:05,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 44 letters. Loop has 23 letters. [2020-07-29 03:17:05,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 44 letters. Loop has 23 letters. [2020-07-29 03:17:05,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:17:05,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:17:05,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:17:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:17:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:17:05,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 34 letters. Loop has 25 letters. [2020-07-29 03:17:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 45 letters. Loop has 24 letters. [2020-07-29 03:17:05,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 24 letters. [2020-07-29 03:17:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 45 letters. Loop has 24 letters. [2020-07-29 03:17:05,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 24 letters. [2020-07-29 03:17:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 24 letters. [2020-07-29 03:17:05,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 24 letters. [2020-07-29 03:17:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 48 letters. Loop has 23 letters. [2020-07-29 03:17:05,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 48 letters. Loop has 23 letters. [2020-07-29 03:17:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 48 letters. Loop has 23 letters. [2020-07-29 03:17:05,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 49 letters. Loop has 23 letters. [2020-07-29 03:17:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 23 letters. [2020-07-29 03:17:05,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 49 letters. Loop has 23 letters. [2020-07-29 03:17:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 50 letters. Loop has 23 letters. [2020-07-29 03:17:05,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 50 letters. Loop has 23 letters. [2020-07-29 03:17:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 50 letters. Loop has 23 letters. [2020-07-29 03:17:05,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 37 letters. Loop has 24 letters. [2020-07-29 03:17:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 24 letters. [2020-07-29 03:17:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 37 letters. Loop has 24 letters. [2020-07-29 03:17:05,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 38 letters. Loop has 26 letters. [2020-07-29 03:17:05,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 38 letters. Loop has 26 letters. [2020-07-29 03:17:05,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 38 letters. Loop has 26 letters. [2020-07-29 03:17:05,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:17:05,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:17:05,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 46 letters. Loop has 25 letters. [2020-07-29 03:17:05,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 43 letters. Loop has 26 letters. [2020-07-29 03:17:05,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 43 letters. Loop has 26 letters. [2020-07-29 03:17:05,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 43 letters. Loop has 26 letters. [2020-07-29 03:17:05,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:17:05,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:17:05,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 51 letters. Loop has 23 letters. [2020-07-29 03:17:05,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 49 letters. Loop has 24 letters. [2020-07-29 03:17:05,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 24 letters. [2020-07-29 03:17:05,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 49 letters. Loop has 24 letters. [2020-07-29 03:17:05,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 35 letters. Loop has 26 letters. [2020-07-29 03:17:05,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 26 letters. [2020-07-29 03:17:05,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 35 letters. Loop has 26 letters. [2020-07-29 03:17:05,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 39 letters. Loop has 26 letters. [2020-07-29 03:17:05,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 39 letters. Loop has 26 letters. [2020-07-29 03:17:05,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 39 letters. Loop has 26 letters. [2020-07-29 03:17:05,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 91 states and 126 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:05,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:05,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 152 states and 223 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:17:05,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,967 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:17:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:17:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2020-07-29 03:17:05,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 30 letters. Loop has 23 letters. [2020-07-29 03:17:05,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 53 letters. Loop has 23 letters. [2020-07-29 03:17:05,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 126 transitions. Stem has 30 letters. Loop has 46 letters. [2020-07-29 03:17:05,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:17:05,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 223 transitions. cyclomatic complexity: 72 [2020-07-29 03:17:05,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:05,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 0 states and 0 transitions. [2020-07-29 03:17:05,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:05,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:05,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:05,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:05,980 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:05,980 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:05,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:17:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 03:17:05,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 03:17:05,981 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2020-07-29 03:17:05,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:17:05,981 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 03:17:05,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 03:17:05,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:17:06,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:17:06,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 03:17:06,136 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:06,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 03:17:06,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 03:17:06,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 03:17:06,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 03:17:06,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:17:06,137 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:06,137 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:06,137 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 03:17:06,137 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:17:06,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 03:17:06,137 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 03:17:06,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 03:17:06,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 03:17:06 BoogieIcfgContainer [2020-07-29 03:17:06,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 03:17:06,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 03:17:06,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 03:17:06,147 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 03:17:06,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:16:58" (3/4) ... [2020-07-29 03:17:06,152 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 03:17:06,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 03:17:06,155 INFO L168 Benchmark]: Toolchain (without parser) took 9061.19 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.0 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -357.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:06,156 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:06,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:06,157 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.11 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:06,158 INFO L168 Benchmark]: Boogie Preprocessor took 60.06 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:06,158 INFO L168 Benchmark]: RCFGBuilder took 893.43 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: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. [2020-07-29 03:17:06,159 INFO L168 Benchmark]: BuchiAutomizer took 7539.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -253.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:17:06,160 INFO L168 Benchmark]: Witness Printer took 6.06 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:06,163 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.11 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.06 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 893.43 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: 72.0 MB). Peak memory consumption was 72.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7539.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -253.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 6.06 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 15 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.0s. Büchi inclusion checks took 2.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 61 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 91 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 403 SDtfs, 301 SDslu, 895 SDs, 0 SdLazy, 36 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital120 mio100 ax139 hnf109 lsp25 ukn100 mio100 lsp100 div102 bol100 ite100 ukn100 eq222 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms 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...