./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.1.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:12,686 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:12,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:12,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:12,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:12,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:12,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:12,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:12,744 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:12,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:12,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:12,749 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:12,750 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:12,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:12,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:12,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:12,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:12,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:12,759 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:12,764 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:12,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:12,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:12,768 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:12,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:12,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:12,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:12,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:12,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:12,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:12,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:12,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:12,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:12,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:12,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:12,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:12,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:12,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:12,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:12,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:12,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:12,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:12,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:28:12,829 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:12,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:12,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:12,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:12,831 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:12,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:12,835 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:12,835 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:12,835 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:12,835 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:12,836 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:12,836 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:12,837 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:12,837 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:12,837 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:12,837 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:12,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:12,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:12,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:12,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:12,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:12,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:12,838 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:12,838 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:12,840 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:12,840 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:12,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:12,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:12,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:12,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:12,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:12,842 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:12,842 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 308b0e1adc3ae7348985993203af7f0b3a83352e3d43ffbdb40ed727e63d4081 [2022-02-21 04:28:13,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:13,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:13,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:13,126 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:13,127 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:13,128 INFO L432 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.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:13,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004ac7492/794883db64844d85b59a2576e397799c/FLAGdddc3dd99 [2022-02-21 04:28:13,710 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:13,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:13,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004ac7492/794883db64844d85b59a2576e397799c/FLAGdddc3dd99 [2022-02-21 04:28:14,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004ac7492/794883db64844d85b59a2576e397799c [2022-02-21 04:28:14,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:14,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:14,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:14,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:14,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:14,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6501fb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14, skipping insertion in model container [2022-02-21 04:28:14,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:14,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:14,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2022-02-21 04:28:14,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:14,302 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:14,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c[9433,9446] [2022-02-21 04:28:14,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:14,352 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:14,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14 WrapperNode [2022-02-21 04:28:14,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:14,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:14,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:14,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:14,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,367 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,416 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 305 [2022-02-21 04:28:14,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:14,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:14,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:14,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:14,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:14,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:14,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:14,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:14,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (1/1) ... [2022-02-21 04:28:14,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:14,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:14,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:28:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:14,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:14,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:14,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:14,723 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:14,725 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:15,109 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:15,115 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:15,115 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:15,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:15 BoogieIcfgContainer [2022-02-21 04:28:15,117 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:15,118 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:15,118 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:15,121 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:15,121 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:15,121 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:14" (1/3) ... [2022-02-21 04:28:15,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e5bd640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:15, skipping insertion in model container [2022-02-21 04:28:15,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:15,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:14" (2/3) ... [2022-02-21 04:28:15,123 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e5bd640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:15, skipping insertion in model container [2022-02-21 04:28:15,123 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:15,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:15" (3/3) ... [2022-02-21 04:28:15,124 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:15,161 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:15,162 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:15,162 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:15,162 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:15,162 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:15,162 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:15,162 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:15,162 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:15,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:15,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:28:15,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:15,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:15,235 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:15,235 INFO L843 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] [2022-02-21 04:28:15,236 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:15,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:15,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:28:15,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:15,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:15,251 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:15,251 INFO L843 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] [2022-02-21 04:28:15,257 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~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; 35#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 23#L203true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 78#L203-1true init_#res#1 := init_~tmp~0#1; 52#L300true main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 75#L352true assume !(0 == main_~i2~0#1); 24#L352-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#1 := 0; 45#L362-2true [2022-02-21 04:28:15,258 INFO L793 eck$LassoCheckResult]: Loop: 45#L362-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 101#L65true 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#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 16#L69true assume !(node1_~m1~0#1 != ~nomsg~0); 93#L69-1true ~mode1~0 := 0; 34#L65-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 39#L102true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 20#L105true assume !(node2_~m2~0#1 != ~nomsg~0); 48#L105-1true ~mode2~0 := 0; 38#L102-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 17#L136true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 27#L139true assume !(node3_~m3~0#1 != ~nomsg~0); 10#L139-1true ~mode3~0 := 0; 29#L136-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 55#L170true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 47#L173true assume !(node4_~m4~0#1 != ~nomsg~0); 83#L173-1true ~mode4~0 := 0; 44#L170-2true assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 12#L308true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 25#L308-1true check_#res#1 := check_~tmp~1#1; 66#L320true main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 18#L389true assume !(0 == assert_~arg#1 % 256); 99#L384true assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 45#L362-2true [2022-02-21 04:28:15,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:15,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-02-21 04:28:15,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:15,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199184286] [2022-02-21 04:28:15,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:15,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:15,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~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; {103#true} is VALID [2022-02-21 04:28:15,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {103#true} is VALID [2022-02-21 04:28:15,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {103#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:28:15,520 INFO L290 TraceCheckUtils]: 3: Hoare triple {105#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {106#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:28:15,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {106#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {107#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:28:15,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {107#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {104#false} is VALID [2022-02-21 04:28:15,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {104#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#1 := 0; {104#false} is VALID [2022-02-21 04:28:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:15,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:15,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199184286] [2022-02-21 04:28:15,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199184286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:15,526 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:15,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:15,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920357725] [2022-02-21 04:28:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:15,532 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:15,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 1 times [2022-02-21 04:28:15,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:15,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458922952] [2022-02-21 04:28:15,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:15,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#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#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#true} assume !(node1_~m1~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:15,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~mode1~0 := 0; {108#true} is VALID [2022-02-21 04:28:15,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {108#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {108#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} assume !(node2_~m2~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:15,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#true} ~mode2~0 := 0; {108#true} is VALID [2022-02-21 04:28:15,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {108#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {108#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#true} assume !(node3_~m3~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:15,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#true} ~mode3~0 := 0; {108#true} is VALID [2022-02-21 04:28:15,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {108#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {108#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {108#true} is VALID [2022-02-21 04:28:15,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {108#true} assume !(node4_~m4~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:15,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {108#true} ~mode4~0 := 0; {108#true} is VALID [2022-02-21 04:28:15,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {108#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {108#true} is VALID [2022-02-21 04:28:15,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {108#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {110#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:15,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {110#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {111#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:15,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {111#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {112#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:28:15,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {112#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {109#false} is VALID [2022-02-21 04:28:15,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {109#false} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {109#false} is VALID [2022-02-21 04:28:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:15,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:15,781 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458922952] [2022-02-21 04:28:15,781 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458922952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:15,781 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:15,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:15,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384322825] [2022-02-21 04:28:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:15,783 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:15,784 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:15,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:15,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:15,819 INFO L87 Difference]: Start difference. First operand has 99 states, 98 states have (on average 1.683673469387755) internal successors, (165), 98 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:16,288 INFO L93 Difference]: Finished difference Result 167 states and 268 transitions. [2022-02-21 04:28:16,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:28:16,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:16,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 268 transitions. [2022-02-21 04:28:16,329 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:16,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 158 states and 236 transitions. [2022-02-21 04:28:16,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-02-21 04:28:16,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2022-02-21 04:28:16,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 236 transitions. [2022-02-21 04:28:16,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:16,345 INFO L681 BuchiCegarLoop]: Abstraction has 158 states and 236 transitions. [2022-02-21 04:28:16,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 236 transitions. [2022-02-21 04:28:16,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2022-02-21 04:28:16,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:16,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states and 236 transitions. Second operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,394 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states and 236 transitions. Second operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,396 INFO L87 Difference]: Start difference. First operand 158 states and 236 transitions. Second operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:16,406 INFO L93 Difference]: Finished difference Result 158 states and 236 transitions. [2022-02-21 04:28:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2022-02-21 04:28:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:16,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:16,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 158 states and 236 transitions. [2022-02-21 04:28:16,409 INFO L87 Difference]: Start difference. First operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 158 states and 236 transitions. [2022-02-21 04:28:16,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:16,415 INFO L93 Difference]: Finished difference Result 158 states and 236 transitions. [2022-02-21 04:28:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2022-02-21 04:28:16,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:16,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:16,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:16,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 93 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2022-02-21 04:28:16,423 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-02-21 04:28:16,423 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-02-21 04:28:16,424 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:16,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 133 transitions. [2022-02-21 04:28:16,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:16,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:16,426 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:16,427 INFO L842 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] [2022-02-21 04:28:16,428 INFO L843 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] [2022-02-21 04:28:16,429 INFO L791 eck$LassoCheckResult]: Stem: 370#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~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; 361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 345#L203 assume 0 == ~r1~0; 346#L204 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 307#L205 assume ~id1~0 >= 0; 308#L206 assume 0 == ~st1~0; 297#L207 assume ~send1~0 == ~id1~0; 298#L208 assume 0 == ~mode1~0 % 256; 357#L209 assume ~id2~0 >= 0; 313#L210 assume 0 == ~st2~0; 314#L211 assume ~send2~0 == ~id2~0; 299#L212 assume 0 == ~mode2~0 % 256; 300#L213 assume ~id3~0 >= 0; 375#L214 assume 0 == ~st3~0; 376#L215 assume ~send3~0 == ~id3~0; 356#L216 assume 0 == ~mode3~0 % 256; 339#L217 assume ~id4~0 >= 0; 340#L218 assume 0 == ~st4~0; 362#L219 assume ~send4~0 == ~id4~0; 377#L220 assume 0 == ~mode4~0 % 256; 336#L221 assume ~id1~0 != ~id2~0; 334#L222 assume ~id1~0 != ~id3~0; 335#L223 assume ~id1~0 != ~id4~0; 320#L224 assume ~id2~0 != ~id3~0; 321#L225 assume ~id2~0 != ~id4~0; 318#L226 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 319#L203-1 init_#res#1 := init_~tmp~0#1; 359#L300 main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 353#L352 assume !(0 == main_~i2~0#1); 347#L352-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#1 := 0; 348#L362-2 [2022-02-21 04:28:16,430 INFO L793 eck$LassoCheckResult]: Loop: 348#L362-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 368#L65 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#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 327#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 294#L69-1 ~mode1~0 := 0; 324#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 358#L102 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 337#L105 assume !(node2_~m2~0#1 != ~nomsg~0); 287#L105-1 ~mode2~0 := 0; 360#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 330#L136 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 331#L139 assume !(node3_~m3~0#1 != ~nomsg~0); 305#L139-1 ~mode3~0 := 0; 312#L136-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 352#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 373#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 290#L173-1 ~mode4~0 := 0; 363#L170-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 315#L308 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 317#L308-1 check_#res#1 := check_~tmp~1#1; 325#L320 main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 326#L389 assume !(0 == assert_~arg#1 % 256); 329#L384 assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 348#L362-2 [2022-02-21 04:28:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-02-21 04:28:16,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:16,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510398655] [2022-02-21 04:28:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:16,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:16,534 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:16,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 2 times [2022-02-21 04:28:16,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:16,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485949079] [2022-02-21 04:28:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:16,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {699#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {699#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#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {699#true} assume !(node1_~m1~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:16,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {699#true} ~mode1~0 := 0; {699#true} is VALID [2022-02-21 04:28:16,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {699#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {699#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#true} assume !(node2_~m2~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:16,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#true} ~mode2~0 := 0; {699#true} is VALID [2022-02-21 04:28:16,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {699#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {699#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#true} assume !(node3_~m3~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:16,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {699#true} ~mode3~0 := 0; {699#true} is VALID [2022-02-21 04:28:16,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {699#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {699#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {699#true} is VALID [2022-02-21 04:28:16,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {699#true} assume !(node4_~m4~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:16,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {699#true} ~mode4~0 := 0; {699#true} is VALID [2022-02-21 04:28:16,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {699#true} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {699#true} is VALID [2022-02-21 04:28:16,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {699#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {701#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:28:16,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {701#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {702#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:28:16,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {702#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {703#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:28:16,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {703#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {700#false} is VALID [2022-02-21 04:28:16,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {700#false} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {700#false} is VALID [2022-02-21 04:28:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:16,652 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:16,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485949079] [2022-02-21 04:28:16,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485949079] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:16,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:16,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:16,653 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825947890] [2022-02-21 04:28:16,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:16,654 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:16,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:16,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:16,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:16,655 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. cyclomatic complexity: 40 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:16,967 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2022-02-21 04:28:16,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:16,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:16,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:16,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 135 transitions. [2022-02-21 04:28:16,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:16,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 94 states and 131 transitions. [2022-02-21 04:28:16,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2022-02-21 04:28:16,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-02-21 04:28:16,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 131 transitions. [2022-02-21 04:28:16,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:16,999 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-02-21 04:28:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 131 transitions. [2022-02-21 04:28:17,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-21 04:28:17,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:17,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states and 131 transitions. Second operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:17,005 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states and 131 transitions. Second operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:17,005 INFO L87 Difference]: Start difference. First operand 94 states and 131 transitions. Second operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:17,009 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2022-02-21 04:28:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2022-02-21 04:28:17,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:17,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:17,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 94 states and 131 transitions. [2022-02-21 04:28:17,011 INFO L87 Difference]: Start difference. First operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 94 states and 131 transitions. [2022-02-21 04:28:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:17,014 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2022-02-21 04:28:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2022-02-21 04:28:17,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:17,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:17,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:17,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:17,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 93 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:17,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2022-02-21 04:28:17,019 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-02-21 04:28:17,019 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-02-21 04:28:17,019 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:17,020 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 131 transitions. [2022-02-21 04:28:17,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:17,020 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:17,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:17,021 INFO L842 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] [2022-02-21 04:28:17,022 INFO L843 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] [2022-02-21 04:28:17,022 INFO L791 eck$LassoCheckResult]: Stem: 891#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~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; 882#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 866#L203 assume 0 == ~r1~0; 867#L204 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 829#L205 assume ~id1~0 >= 0; 830#L206 assume 0 == ~st1~0; 818#L207 assume ~send1~0 == ~id1~0; 819#L208 assume 0 == ~mode1~0 % 256; 878#L209 assume ~id2~0 >= 0; 834#L210 assume 0 == ~st2~0; 835#L211 assume ~send2~0 == ~id2~0; 822#L212 assume 0 == ~mode2~0 % 256; 823#L213 assume ~id3~0 >= 0; 896#L214 assume 0 == ~st3~0; 897#L215 assume ~send3~0 == ~id3~0; 877#L216 assume 0 == ~mode3~0 % 256; 860#L217 assume ~id4~0 >= 0; 861#L218 assume 0 == ~st4~0; 883#L219 assume ~send4~0 == ~id4~0; 898#L220 assume 0 == ~mode4~0 % 256; 857#L221 assume ~id1~0 != ~id2~0; 855#L222 assume ~id1~0 != ~id3~0; 856#L223 assume ~id1~0 != ~id4~0; 840#L224 assume ~id2~0 != ~id3~0; 841#L225 assume ~id2~0 != ~id4~0; 838#L226 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 839#L203-1 init_#res#1 := init_~tmp~0#1; 880#L300 main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; 874#L352 assume !(0 == main_~i2~0#1); 868#L352-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#1 := 0; 869#L362-2 [2022-02-21 04:28:17,022 INFO L793 eck$LassoCheckResult]: Loop: 869#L362-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 889#L65 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#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 847#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 815#L69-1 ~mode1~0 := 0; 844#L65-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 879#L102 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 858#L105 assume !(node2_~m2~0#1 != ~nomsg~0); 808#L105-1 ~mode2~0 := 0; 881#L102-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 850#L136 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 851#L139 assume !(node3_~m3~0#1 != ~nomsg~0); 826#L139-1 ~mode3~0 := 0; 828#L136-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 873#L170 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 894#L173 assume !(node4_~m4~0#1 != ~nomsg~0); 811#L173-1 ~mode4~0 := 0; 884#L170-2 assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 836#L308 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 837#L309 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 853#L308-1 check_#res#1 := check_~tmp~1#1; 845#L320 main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 846#L389 assume !(0 == assert_~arg#1 % 256); 849#L384 assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; 869#L362-2 [2022-02-21 04:28:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-02-21 04:28:17,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:17,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256531521] [2022-02-21 04:28:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:17,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:17,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:17,110 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:17,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2027257471, now seen corresponding path program 1 times [2022-02-21 04:28:17,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:17,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17457668] [2022-02-21 04:28:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:17,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:17,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:17,149 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:17,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2125885643, now seen corresponding path program 1 times [2022-02-21 04:28:17,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:17,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983727151] [2022-02-21 04:28:17,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:17,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:17,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1094#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~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; {1094#true} is VALID [2022-02-21 04:28:17,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {1094#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1094#true} is VALID [2022-02-21 04:28:17,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {1094#true} assume 0 == ~r1~0; {1094#true} is VALID [2022-02-21 04:28:17,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {1094#true} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1094#true} is VALID [2022-02-21 04:28:17,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {1094#true} assume ~id1~0 >= 0; {1094#true} is VALID [2022-02-21 04:28:17,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {1094#true} assume 0 == ~st1~0; {1094#true} is VALID [2022-02-21 04:28:17,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {1094#true} assume ~send1~0 == ~id1~0; {1094#true} is VALID [2022-02-21 04:28:17,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {1094#true} assume 0 == ~mode1~0 % 256; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main_~i2~0#1); {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 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#1 := 0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:28:17,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {1096#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {1095#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:17,226 INFO L290 TraceCheckUtils]: 33: Hoare triple {1095#false} ~mode1~0 := 0; {1095#false} is VALID [2022-02-21 04:28:17,226 INFO L290 TraceCheckUtils]: 34: Hoare triple {1095#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {1095#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {1095#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:17,226 INFO L290 TraceCheckUtils]: 37: Hoare triple {1095#false} ~mode2~0 := 0; {1095#false} is VALID [2022-02-21 04:28:17,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {1095#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,227 INFO L290 TraceCheckUtils]: 39: Hoare triple {1095#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,227 INFO L290 TraceCheckUtils]: 40: Hoare triple {1095#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:17,227 INFO L290 TraceCheckUtils]: 41: Hoare triple {1095#false} ~mode3~0 := 0; {1095#false} is VALID [2022-02-21 04:28:17,227 INFO L290 TraceCheckUtils]: 42: Hoare triple {1095#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,228 INFO L290 TraceCheckUtils]: 43: Hoare triple {1095#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1095#false} is VALID [2022-02-21 04:28:17,228 INFO L290 TraceCheckUtils]: 44: Hoare triple {1095#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:17,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {1095#false} ~mode4~0 := 0; {1095#false} is VALID [2022-02-21 04:28:17,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {1095#false} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1095#false} is VALID [2022-02-21 04:28:17,229 INFO L290 TraceCheckUtils]: 47: Hoare triple {1095#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1095#false} is VALID [2022-02-21 04:28:17,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {1095#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {1095#false} is VALID [2022-02-21 04:28:17,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {1095#false} check_#res#1 := check_~tmp~1#1; {1095#false} is VALID [2022-02-21 04:28:17,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {1095#false} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1095#false} is VALID [2022-02-21 04:28:17,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {1095#false} assume !(0 == assert_~arg#1 % 256); {1095#false} is VALID [2022-02-21 04:28:17,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {1095#false} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {1095#false} is VALID [2022-02-21 04:28:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:17,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:17,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983727151] [2022-02-21 04:28:17,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983727151] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:17,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:17,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:17,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230728241] [2022-02-21 04:28:17,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:17,949 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:17,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:17,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:17,951 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:17,951 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:17,951 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:17,951 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:17,951 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:17,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:28:17,952 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:17,952 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:17,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:17,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:17,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,716 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:18,717 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:18,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:18,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:18,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:18,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:18,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:18,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:28:18,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:18,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:18,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:18,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:18,790 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:18,790 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:18,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:28:18,957 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:18,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:18,961 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:18,961 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:18,961 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:18,961 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:18,961 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:18,962 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:18,962 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:18,962 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:18,962 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:28:18,962 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:18,962 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:18,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:18,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:28:19,735 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:19,739 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:19,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:19,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:19,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:19,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:28:19,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:19,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:19,763 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:19,763 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:19,763 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:19,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:19,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:19,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:19,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:19,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:19,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:19,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:19,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:19,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:28:19,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:19,803 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:19,803 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:19,803 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:19,803 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:19,804 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:19,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:19,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:19,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:28:19,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:19,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:19,824 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:19,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:28:19,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:19,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:19,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:19,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:19,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:19,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:19,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:19,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:19,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:19,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:28:19,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:19,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:19,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:28:19,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:28:19,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:19,859 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:19,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:19,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:19,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:19,860 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:19,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:19,862 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:19,866 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:19,866 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:19,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:19,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:19,876 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:28:19,879 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:19,879 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:19,879 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:19,880 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:28:19,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:28:19,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:19,915 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:19,922 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node1_~m1~0#1 != ~nomsg~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0#1 != ~nomsg~0);" "~mode2~0 := 0;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0#1 != ~nomsg~0);" "~mode3~0 := 0;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~r1~0 < 4;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1;" [2022-02-21 04:28:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:19,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:20,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:20,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {1097#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(49, 2);call #Ultimate.allocInit(12, 3);~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; {1097#unseeded} is VALID [2022-02-21 04:28:20,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {1097#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~ret33#1, main_#t~ret34#1, main_#t~post35#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~alive1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~alive2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~id3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~st3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~send3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~alive3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id4~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st4~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send4~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode4~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~alive4~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1097#unseeded} is VALID [2022-02-21 04:28:20,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {1097#unseeded} assume 0 == ~r1~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {1097#unseeded} assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; {1097#unseeded} is VALID [2022-02-21 04:28:20,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {1097#unseeded} assume ~id1~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:20,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {1097#unseeded} assume 0 == ~st1~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {1097#unseeded} assume ~send1~0 == ~id1~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {1097#unseeded} assume 0 == ~mode1~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:20,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#unseeded} assume ~id2~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:20,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#unseeded} assume 0 == ~st2~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#unseeded} assume ~send2~0 == ~id2~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {1097#unseeded} assume 0 == ~mode2~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:20,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {1097#unseeded} assume ~id3~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:20,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {1097#unseeded} assume 0 == ~st3~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {1097#unseeded} assume ~send3~0 == ~id3~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#unseeded} assume 0 == ~mode3~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:20,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {1097#unseeded} assume ~id4~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:20,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {1097#unseeded} assume 0 == ~st4~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {1097#unseeded} assume ~send4~0 == ~id4~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {1097#unseeded} assume 0 == ~mode4~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:20,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {1097#unseeded} assume ~id1~0 != ~id2~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {1097#unseeded} assume ~id1~0 != ~id3~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {1097#unseeded} assume ~id1~0 != ~id4~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {1097#unseeded} assume ~id2~0 != ~id3~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {1097#unseeded} assume ~id2~0 != ~id4~0; {1097#unseeded} is VALID [2022-02-21 04:28:20,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {1097#unseeded} assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; {1097#unseeded} is VALID [2022-02-21 04:28:20,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {1097#unseeded} init_#res#1 := init_~tmp~0#1; {1097#unseeded} is VALID [2022-02-21 04:28:20,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {1097#unseeded} main_#t~ret33#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret33#1;havoc main_#t~ret33#1; {1097#unseeded} is VALID [2022-02-21 04:28:20,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {1097#unseeded} assume !(0 == main_~i2~0#1); {1097#unseeded} is VALID [2022-02-21 04:28:20,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {1097#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#1 := 0; {1097#unseeded} is VALID [2022-02-21 04:28:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:20,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:20,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:20,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:20,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {1100#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} 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#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node1_~m1~0#1 != ~nomsg~0); {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,490 INFO L290 TraceCheckUtils]: 5: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node2_~m2~0#1 != ~nomsg~0); {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,491 INFO L290 TraceCheckUtils]: 7: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node3_~m3~0#1 != ~nomsg~0); {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite10#1, node4_#t~ite11#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(node4_~m4~0#1 != ~nomsg~0); {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 0; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node4 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret34#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret34#1;havoc main_#t~ret34#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:28:20,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {1202#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post35#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post35#1;havoc main_#t~post35#1; {1110#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:28:20,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:28:20,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:20,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,533 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 [2022-02-21 04:28:20,534 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 131 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,763 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 131 transitions. cyclomatic complexity: 38. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 158 states and 233 transitions. Complement of second has 4 states. [2022-02-21 04:28:20,763 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 [2022-02-21 04:28:20,764 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:20,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 131 transitions. cyclomatic complexity: 38 [2022-02-21 04:28:20,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:20,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:20,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:20,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:20,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:20,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 233 transitions. [2022-02-21 04:28:20,774 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:20,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:20,778 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 94 states and 131 transitions. cyclomatic complexity: 38 [2022-02-21 04:28:20,810 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 64 examples of accepted words. [2022-02-21 04:28:20,811 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:20,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:20,814 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 158 states and 233 transitions. cyclomatic complexity: 76 [2022-02-21 04:28:20,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 233 transitions. cyclomatic complexity: 76 [2022-02-21 04:28:20,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:20,814 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:20,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:20,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:20,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:20,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 158 letters. Loop has 158 letters. [2022-02-21 04:28:20,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 158 letters. Loop has 158 letters. [2022-02-21 04:28:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 158 letters. Loop has 158 letters. [2022-02-21 04:28:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 94 letters. Loop has 94 letters. [2022-02-21 04:28:20,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 94 letters. [2022-02-21 04:28:20,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 94 letters. Loop has 94 letters. [2022-02-21 04:28:20,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:20,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:20,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:28:20,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 33 letters. Loop has 25 letters. [2022-02-21 04:28:20,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 25 letters. [2022-02-21 04:28:20,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 25 letters. [2022-02-21 04:28:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:20,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:20,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:20,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:20,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:20,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 37 letters. Loop has 23 letters. [2022-02-21 04:28:20,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 23 letters. [2022-02-21 04:28:20,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 37 letters. Loop has 23 letters. [2022-02-21 04:28:20,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:20,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:20,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:20,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:20,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:20,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:20,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 45 letters. Loop has 23 letters. [2022-02-21 04:28:20,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 23 letters. [2022-02-21 04:28:20,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 45 letters. Loop has 23 letters. [2022-02-21 04:28:20,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:28:20,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:28:20,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 26 letters. [2022-02-21 04:28:20,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:20,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:20,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:20,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:20,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:20,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 35 letters. Loop has 26 letters. [2022-02-21 04:28:20,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 23 letters. [2022-02-21 04:28:20,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:20,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:20,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 47 letters. Loop has 26 letters. [2022-02-21 04:28:20,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 46 letters. Loop has 24 letters. [2022-02-21 04:28:20,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 24 letters. [2022-02-21 04:28:20,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 46 letters. Loop has 24 letters. [2022-02-21 04:28:20,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:28:20,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:28:20,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 42 letters. Loop has 26 letters. [2022-02-21 04:28:20,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:20,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:20,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:20,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:20,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:20,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 25 letters. [2022-02-21 04:28:20,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:20,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:20,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 43 letters. Loop has 26 letters. [2022-02-21 04:28:20,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 41 letters. Loop has 23 letters. [2022-02-21 04:28:20,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 23 letters. [2022-02-21 04:28:20,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 41 letters. Loop has 23 letters. [2022-02-21 04:28:20,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:20,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:20,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 46 letters. Loop has 25 letters. [2022-02-21 04:28:20,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 42 letters. Loop has 23 letters. [2022-02-21 04:28:20,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 23 letters. [2022-02-21 04:28:20,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 42 letters. Loop has 23 letters. [2022-02-21 04:28:20,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 40 letters. Loop has 24 letters. [2022-02-21 04:28:20,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 24 letters. [2022-02-21 04:28:20,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 40 letters. Loop has 24 letters. [2022-02-21 04:28:20,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:20,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:20,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:20,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 41 letters. Loop has 25 letters. [2022-02-21 04:28:20,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 25 letters. [2022-02-21 04:28:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 41 letters. Loop has 25 letters. [2022-02-21 04:28:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 47 letters. Loop has 23 letters. [2022-02-21 04:28:20,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 23 letters. [2022-02-21 04:28:20,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 47 letters. Loop has 23 letters. [2022-02-21 04:28:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 48 letters. Loop has 23 letters. [2022-02-21 04:28:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 23 letters. [2022-02-21 04:28:20,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 48 letters. Loop has 23 letters. [2022-02-21 04:28:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:28:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:28:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 46 letters. Loop has 26 letters. [2022-02-21 04:28:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 24 letters. [2022-02-21 04:28:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 24 letters. [2022-02-21 04:28:20,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 24 letters. [2022-02-21 04:28:20,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 34 letters. Loop has 23 letters. [2022-02-21 04:28:20,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 34 letters. Loop has 23 letters. [2022-02-21 04:28:20,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 34 letters. Loop has 23 letters. [2022-02-21 04:28:20,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 50 letters. Loop has 23 letters. [2022-02-21 04:28:20,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 23 letters. [2022-02-21 04:28:20,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 50 letters. Loop has 23 letters. [2022-02-21 04:28:20,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 51 letters. Loop has 23 letters. [2022-02-21 04:28:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 23 letters. [2022-02-21 04:28:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 51 letters. Loop has 23 letters. [2022-02-21 04:28:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 32 letters. Loop has 23 letters. [2022-02-21 04:28:20,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:20,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:20,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:20,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 52 letters. Loop has 23 letters. [2022-02-21 04:28:20,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 23 letters. [2022-02-21 04:28:20,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 52 letters. Loop has 23 letters. [2022-02-21 04:28:20,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 39 letters. Loop has 23 letters. [2022-02-21 04:28:20,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 23 letters. [2022-02-21 04:28:20,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 39 letters. Loop has 23 letters. [2022-02-21 04:28:20,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 40 letters. Loop has 23 letters. [2022-02-21 04:28:20,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 23 letters. [2022-02-21 04:28:20,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 40 letters. Loop has 23 letters. [2022-02-21 04:28:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 45 letters. Loop has 25 letters. [2022-02-21 04:28:20,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 25 letters. [2022-02-21 04:28:20,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 45 letters. Loop has 25 letters. [2022-02-21 04:28:20,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 49 letters. Loop has 23 letters. [2022-02-21 04:28:20,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 23 letters. [2022-02-21 04:28:20,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 49 letters. Loop has 23 letters. [2022-02-21 04:28:20,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 49 letters. Loop has 24 letters. [2022-02-21 04:28:20,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 24 letters. [2022-02-21 04:28:20,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 49 letters. Loop has 24 letters. [2022-02-21 04:28:20,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 36 letters. Loop has 23 letters. [2022-02-21 04:28:20,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 23 letters. [2022-02-21 04:28:20,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 36 letters. Loop has 23 letters. [2022-02-21 04:28:20,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:20,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:20,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:20,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:28:20,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:28:20,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 38 letters. Loop has 26 letters. [2022-02-21 04:28:20,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:20,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:20,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 39 letters. Loop has 26 letters. [2022-02-21 04:28:20,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:20,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:20,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:20,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:20,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:20,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 33 letters. Loop has 24 letters. [2022-02-21 04:28:20,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:20,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:20,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 41 letters. Loop has 24 letters. [2022-02-21 04:28:20,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:20,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:20,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:20,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 38 letters. Loop has 24 letters. [2022-02-21 04:28:20,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 24 letters. [2022-02-21 04:28:20,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 38 letters. Loop has 24 letters. [2022-02-21 04:28:20,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 43 letters. Loop has 23 letters. [2022-02-21 04:28:20,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 23 letters. [2022-02-21 04:28:20,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 43 letters. Loop has 23 letters. [2022-02-21 04:28:20,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 32 letters. Loop has 24 letters. [2022-02-21 04:28:20,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 32 letters. Loop has 24 letters. [2022-02-21 04:28:20,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 32 letters. Loop has 24 letters. [2022-02-21 04:28:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 42 letters. Loop has 24 letters. [2022-02-21 04:28:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 24 letters. [2022-02-21 04:28:20,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 42 letters. Loop has 24 letters. [2022-02-21 04:28:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 35 letters. Loop has 23 letters. [2022-02-21 04:28:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 35 letters. Loop has 23 letters. [2022-02-21 04:28:20,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 35 letters. Loop has 23 letters. [2022-02-21 04:28:20,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 38 letters. Loop has 23 letters. [2022-02-21 04:28:20,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 23 letters. [2022-02-21 04:28:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 38 letters. Loop has 23 letters. [2022-02-21 04:28:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 46 letters. Loop has 23 letters. [2022-02-21 04:28:20,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 23 letters. [2022-02-21 04:28:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 46 letters. Loop has 23 letters. [2022-02-21 04:28:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:20,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:20,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 42 letters. Loop has 25 letters. [2022-02-21 04:28:20,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 36 letters. Loop has 24 letters. [2022-02-21 04:28:20,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 36 letters. Loop has 24 letters. [2022-02-21 04:28:20,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 36 letters. Loop has 24 letters. [2022-02-21 04:28:20,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 37 letters. Loop has 25 letters. [2022-02-21 04:28:20,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 25 letters. [2022-02-21 04:28:20,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 37 letters. Loop has 25 letters. [2022-02-21 04:28:20,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:20,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:20,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 37 letters. Loop has 24 letters. [2022-02-21 04:28:20,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 31 letters. Loop has 23 letters. [2022-02-21 04:28:20,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 31 letters. Loop has 23 letters. [2022-02-21 04:28:20,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 31 letters. Loop has 23 letters. [2022-02-21 04:28:20,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:20,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 38 letters. Loop has 25 letters. [2022-02-21 04:28:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 44 letters. Loop has 24 letters. [2022-02-21 04:28:20,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 24 letters. [2022-02-21 04:28:20,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 44 letters. Loop has 24 letters. [2022-02-21 04:28:20,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:20,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:20,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:20,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 44 letters. Loop has 23 letters. [2022-02-21 04:28:20,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 23 letters. [2022-02-21 04:28:20,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 44 letters. Loop has 23 letters. [2022-02-21 04:28:20,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:20,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:20,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 45 letters. Loop has 24 letters. [2022-02-21 04:28:20,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 94 states and 131 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:20,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:20,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 158 states and 233 transitions. cyclomatic complexity: 76 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:28:20,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,913 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-21 04:28:20,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:20,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 53 letters. Loop has 23 letters. [2022-02-21 04:28:20,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 46 letters. [2022-02-21 04:28:20,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:20,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 233 transitions. cyclomatic complexity: 76 [2022-02-21 04:28:20,924 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:20,924 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 0 states and 0 transitions. [2022-02-21 04:28:20,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:20,924 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:20,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:20,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:20,925 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:20,925 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:20,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:20,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:20,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:20,927 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:20,927 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:20,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:20,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:28:20,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:28:20,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:20,977 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:20,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:20,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:20,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:20,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:20,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:20,978 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:20,978 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:20,978 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:20,978 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:20,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:20,978 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:20,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:20,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:20 BoogieIcfgContainer [2022-02-21 04:28:20,986 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:20,986 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:20,986 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:20,986 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:20,987 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:15" (3/4) ... [2022-02-21 04:28:20,989 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:20,989 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:20,991 INFO L158 Benchmark]: Toolchain (without parser) took 6946.93ms. Allocated memory was 92.3MB in the beginning and 144.7MB in the end (delta: 52.4MB). Free memory was 69.9MB in the beginning and 41.8MB in the end (delta: 28.1MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2022-02-21 04:28:20,991 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 75.5MB. Free memory was 46.3MB in the beginning and 46.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:20,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.78ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 54.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-21 04:28:20,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.76ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 51.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:20,996 INFO L158 Benchmark]: Boogie Preprocessor took 60.24ms. Allocated memory is still 92.3MB. Free memory was 51.0MB in the beginning and 49.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:20,997 INFO L158 Benchmark]: RCFGBuilder took 638.83ms. Allocated memory is still 92.3MB. Free memory was 48.9MB in the beginning and 52.2MB in the end (delta: -3.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-02-21 04:28:20,997 INFO L158 Benchmark]: BuchiAutomizer took 5867.61ms. Allocated memory was 92.3MB in the beginning and 144.7MB in the end (delta: 52.4MB). Free memory was 51.8MB in the beginning and 41.8MB in the end (delta: 9.9MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. [2022-02-21 04:28:20,997 INFO L158 Benchmark]: Witness Printer took 3.18ms. Allocated memory is still 144.7MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:21,006 INFO L339 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.17ms. Allocated memory is still 75.5MB. Free memory was 46.3MB in the beginning and 46.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.78ms. Allocated memory is still 92.3MB. Free memory was 69.8MB in the beginning and 54.1MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.76ms. Allocated memory is still 92.3MB. Free memory was 54.1MB in the beginning and 51.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.24ms. Allocated memory is still 92.3MB. Free memory was 51.0MB in the beginning and 49.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.83ms. Allocated memory is still 92.3MB. Free memory was 48.9MB in the beginning and 52.2MB in the end (delta: -3.3MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5867.61ms. Allocated memory was 92.3MB in the beginning and 144.7MB in the end (delta: 52.4MB). Free memory was 51.8MB in the beginning and 41.8MB in the end (delta: 9.9MB). Peak memory consumption was 61.5MB. Max. memory is 16.1GB. * Witness Printer took 3.18ms. Allocated memory is still 144.7MB. Free memory is still 41.8MB. There was no memory consumed. Max. memory is 16.1GB. * 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 15 + -2 * i2 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 5.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 1.8s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 94 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 mSDsluCounter, 1348 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 930 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 418 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital145 mio100 ax100 hnf100 lsp34 ukn100 mio100 lsp100 div129 bol100 ite100 ukn100 eq175 hnf85 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:28:21,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE