./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.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.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 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:28:27,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:28:27,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:28:27,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:28:27,895 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:28:27,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:28:27,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:28:27,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:28:27,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:28:27,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:28:27,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:28:27,909 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:28:27,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:28:27,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:28:27,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:28:27,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:28:27,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:28:27,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:28:27,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:28:27,921 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:28:27,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:28:27,926 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:28:27,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:28:27,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:28:27,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:28:27,935 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:28:27,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:28:27,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:28:27,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:28:27,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:28:27,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:28:27,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:28:27,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:28:27,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:28:27,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:28:27,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:28:27,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:28:27,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:28:27,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:28:27,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:28:27,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:28:27,948 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:27,981 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:28:27,983 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:28:27,983 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:28:27,983 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:28:27,985 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:28:27,985 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:28:27,986 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:28:27,986 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:28:27,986 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:28:27,986 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:28:27,987 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:28:27,987 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:28:27,987 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:28:27,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:28:27,988 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:28:27,988 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:28:27,988 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:28:27,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:28:27,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:28:27,989 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:28:27,989 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:28:27,989 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:28:27,989 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:28:27,989 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:28:27,990 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:28:27,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:28:27,990 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:28:27,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:28:27,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:28:27,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:28:27,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:28:27,992 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:28:27,992 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 -> 17ba764d4851428799f2c4794a4662e2753aae472d291b23839dac79bbfbab6d [2022-02-21 04:28:28,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:28:28,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:28:28,253 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:28:28,254 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:28:28,255 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:28:28,256 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.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:28,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4125e1c2/3ad2864a9a2940da8fdb5cf42ed60597/FLAG64d306ae3 [2022-02-21 04:28:28,762 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:28:28,764 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:28,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4125e1c2/3ad2864a9a2940da8fdb5cf42ed60597/FLAG64d306ae3 [2022-02-21 04:28:29,141 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4125e1c2/3ad2864a9a2940da8fdb5cf42ed60597 [2022-02-21 04:28:29,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:28:29,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:28:29,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:29,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:28:29,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:28:29,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:29" (1/1) ... [2022-02-21 04:28:29,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@317a1d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:29, skipping insertion in model container [2022-02-21 04:28:29,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:28:29" (1/1) ... [2022-02-21 04:28:29,161 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:28:29,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:28:29,480 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.ufo.BOUNDED-8.pals.c[9392,9405] [2022-02-21 04:28:29,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:29,488 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:28:29,549 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.ufo.BOUNDED-8.pals.c[9392,9405] [2022-02-21 04:28:29,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:28:29,580 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:28:29,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:29 WrapperNode [2022-02-21 04:28:29,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:28:29,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:29,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:28:29,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:28:29,592 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:29" (1/1) ... [2022-02-21 04:28:29,606 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:29" (1/1) ... [2022-02-21 04:28:29,639 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 304 [2022-02-21 04:28:29,639 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:28:29,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:28:29,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:28:29,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:28:29,647 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:29" (1/1) ... [2022-02-21 04:28:29,647 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:29" (1/1) ... [2022-02-21 04:28:29,649 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:29" (1/1) ... [2022-02-21 04:28:29,650 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:29" (1/1) ... [2022-02-21 04:28:29,655 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:29" (1/1) ... [2022-02-21 04:28:29,659 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:29" (1/1) ... [2022-02-21 04:28:29,661 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:29" (1/1) ... [2022-02-21 04:28:29,663 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:28:29,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:28:29,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:28:29,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:28:29,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:29" (1/1) ... [2022-02-21 04:28:29,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:29,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:29,720 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:29,739 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:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:28:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:28:29,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:28:29,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:28:29,883 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:28:29,885 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:28:30,340 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:28:30,347 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:28:30,348 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:28:30,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:30 BoogieIcfgContainer [2022-02-21 04:28:30,351 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:28:30,353 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:28:30,354 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:28:30,357 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:28:30,358 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:30,358 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:28:29" (1/3) ... [2022-02-21 04:28:30,359 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72668ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:30, skipping insertion in model container [2022-02-21 04:28:30,359 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:30,359 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:28:29" (2/3) ... [2022-02-21 04:28:30,360 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@72668ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:28:30, skipping insertion in model container [2022-02-21 04:28:30,360 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:28:30,360 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:28:30" (3/3) ... [2022-02-21 04:28:30,361 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:28:30,408 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:28:30,408 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:28:30,409 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:28:30,409 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:28:30,409 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:28:30,409 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:28:30,409 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:28:30,409 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:28:30,434 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:30,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:28:30,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:30,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:30,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:30,483 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:30,484 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:28:30,487 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:30,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 65 [2022-02-21 04:28:30,511 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:30,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:30,512 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:28:30,512 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:30,519 INFO L791 eck$LassoCheckResult]: Stem: 89#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(47, 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; 31#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; 45#L201true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 71#L201-1true init_#res#1 := init_~tmp~0#1; 26#L298true 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; 77#L350true assume !(0 == main_~i2~0#1); 82#L350-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; 68#L360-2true [2022-02-21 04:28:30,521 INFO L793 eck$LassoCheckResult]: Loop: 68#L360-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; 13#L69true assume !(node1_~m1~0#1 != ~nomsg~0); 95#L69-1true ~mode1~0 := 0; 30#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; 41#L100true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 88#L103true assume !(node2_~m2~0#1 != ~nomsg~0); 33#L103-1true ~mode2~0 := 0; 75#L100-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; 90#L134true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 43#L137true assume !(node3_~m3~0#1 != ~nomsg~0); 60#L137-1true ~mode3~0 := 0; 46#L134-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; 6#L168true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 84#L171true assume !(node4_~m4~0#1 != ~nomsg~0); 23#L171-1true ~mode4~0 := 0; 12#L168-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; 96#L306true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 85#L306-1true check_#res#1 := check_~tmp~1#1; 93#L318true 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; 38#L387true assume !(0 == assert_~arg#1 % 256); 86#L382true 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; 68#L360-2true [2022-02-21 04:28:30,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1938506578, now seen corresponding path program 1 times [2022-02-21 04:28:30,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:30,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778988823] [2022-02-21 04:28:30,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:30,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:30,762 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(47, 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:30,762 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:30,764 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:30,765 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:30,765 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:30,766 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:30,767 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:30,768 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:30,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:30,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778988823] [2022-02-21 04:28:30,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778988823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:30,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:30,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:30,772 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282411773] [2022-02-21 04:28:30,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:30,776 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:28:30,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:30,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 1 times [2022-02-21 04:28:30,778 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:30,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389541790] [2022-02-21 04:28:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:30,980 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:30,981 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:30,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {108#true} assume !(node1_~m1~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:30,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~mode1~0 := 0; {108#true} is VALID [2022-02-21 04:28:30,981 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:30,982 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:30,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} assume !(node2_~m2~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:30,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {108#true} ~mode2~0 := 0; {108#true} is VALID [2022-02-21 04:28:30,983 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:30,983 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:30,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {108#true} assume !(node3_~m3~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:30,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {108#true} ~mode3~0 := 0; {108#true} is VALID [2022-02-21 04:28:30,984 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:30,984 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:30,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {108#true} assume !(node4_~m4~0#1 != ~nomsg~0); {108#true} is VALID [2022-02-21 04:28:30,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {108#true} ~mode4~0 := 0; {108#true} is VALID [2022-02-21 04:28:30,985 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:30,986 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:30,986 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:30,988 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:30,989 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:30,990 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:30,990 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:30,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:30,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389541790] [2022-02-21 04:28:30,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389541790] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:30,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:30,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:30,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237874371] [2022-02-21 04:28:31,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:31,004 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:31,005 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:31,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:31,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:31,029 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:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:31,467 INFO L93 Difference]: Finished difference Result 167 states and 268 transitions. [2022-02-21 04:28:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:28:31,468 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:31,477 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:31,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 268 transitions. [2022-02-21 04:28:31,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:31,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 158 states and 236 transitions. [2022-02-21 04:28:31,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 158 [2022-02-21 04:28:31,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 158 [2022-02-21 04:28:31,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 158 states and 236 transitions. [2022-02-21 04:28:31,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:31,514 INFO L681 BuchiCegarLoop]: Abstraction has 158 states and 236 transitions. [2022-02-21 04:28:31,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 236 transitions. [2022-02-21 04:28:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 94. [2022-02-21 04:28:31,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:31,540 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:31,541 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:31,543 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:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:31,548 INFO L93 Difference]: Finished difference Result 158 states and 236 transitions. [2022-02-21 04:28:31,549 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2022-02-21 04:28:31,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:31,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:31,551 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:31,551 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:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:31,557 INFO L93 Difference]: Finished difference Result 158 states and 236 transitions. [2022-02-21 04:28:31,557 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2022-02-21 04:28:31,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:31,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:31,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:31,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:31,559 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:31,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2022-02-21 04:28:31,563 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-02-21 04:28:31,563 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 133 transitions. [2022-02-21 04:28:31,563 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:28:31,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 133 transitions. [2022-02-21 04:28:31,564 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:31,564 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:31,564 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:31,565 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:31,565 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:31,566 INFO L791 eck$LassoCheckResult]: Stem: 372#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(47, 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; 362#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; 363#L201 assume 0 == ~r1~0; 333#L202 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 334#L203 assume ~id1~0 >= 0; 349#L204 assume 0 == ~st1~0; 306#L205 assume ~send1~0 == ~id1~0; 307#L206 assume 0 == ~mode1~0 % 256; 295#L207 assume ~id2~0 >= 0; 296#L208 assume 0 == ~st2~0; 359#L209 assume ~send2~0 == ~id2~0; 310#L210 assume 0 == ~mode2~0 % 256; 311#L211 assume ~id3~0 >= 0; 300#L212 assume 0 == ~st3~0; 301#L213 assume ~send3~0 == ~id3~0; 374#L214 assume 0 == ~mode3~0 % 256; 375#L215 assume ~id4~0 >= 0; 358#L216 assume 0 == ~st4~0; 337#L217 assume ~send4~0 == ~id4~0; 338#L218 assume 0 == ~mode4~0 % 256; 366#L219 assume ~id1~0 != ~id2~0; 377#L220 assume ~id1~0 != ~id3~0; 329#L221 assume ~id1~0 != ~id4~0; 325#L222 assume ~id2~0 != ~id3~0; 326#L223 assume ~id2~0 != ~id4~0; 316#L224 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 317#L201-1 init_#res#1 := init_~tmp~0#1; 346#L298 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; 354#L350 assume !(0 == main_~i2~0#1); 357#L350-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; 341#L360-2 [2022-02-21 04:28:31,566 INFO L793 eck$LassoCheckResult]: Loop: 341#L360-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; 342#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; 318#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 292#L69-1 ~mode1~0 := 0; 360#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; 361#L100 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 370#L103 assume !(node2_~m2~0#1 != ~nomsg~0); 331#L103-1 ~mode2~0 := 0; 355#L100-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; 356#L134 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 373#L137 assume !(node3_~m3~0#1 != ~nomsg~0); 314#L137-1 ~mode3~0 := 0; 315#L134-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; 288#L168 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 290#L171 assume !(node4_~m4~0#1 != ~nomsg~0); 345#L171-1 ~mode4~0 := 0; 304#L168-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; 312#L306 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 294#L306-1 check_#res#1 := check_~tmp~1#1; 368#L318 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; 371#L387 assume !(0 == assert_~arg#1 % 256); 369#L382 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; 341#L360-2 [2022-02-21 04:28:31,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 1 times [2022-02-21 04:28:31,567 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:31,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078688095] [2022-02-21 04:28:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:31,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:31,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:31,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:31,630 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1584807191, now seen corresponding path program 2 times [2022-02-21 04:28:31,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:31,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598072703] [2022-02-21 04:28:31,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:31,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:31,734 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:31,735 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:31,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {699#true} assume !(node1_~m1~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:31,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {699#true} ~mode1~0 := 0; {699#true} is VALID [2022-02-21 04:28:31,736 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:31,736 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:31,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {699#true} assume !(node2_~m2~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:31,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {699#true} ~mode2~0 := 0; {699#true} is VALID [2022-02-21 04:28:31,737 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:31,737 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:31,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {699#true} assume !(node3_~m3~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:31,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {699#true} ~mode3~0 := 0; {699#true} is VALID [2022-02-21 04:28:31,737 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:31,738 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:31,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {699#true} assume !(node4_~m4~0#1 != ~nomsg~0); {699#true} is VALID [2022-02-21 04:28:31,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {699#true} ~mode4~0 := 0; {699#true} is VALID [2022-02-21 04:28:31,738 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:31,739 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:31,740 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:31,741 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:31,742 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:31,742 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:31,742 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:31,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:31,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598072703] [2022-02-21 04:28:31,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598072703] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:31,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:31,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:28:31,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014298114] [2022-02-21 04:28:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:31,744 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:28:31,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:28:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:28:31,746 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:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:32,074 INFO L93 Difference]: Finished difference Result 97 states and 135 transitions. [2022-02-21 04:28:32,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:28:32,074 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:32,098 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:32,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 135 transitions. [2022-02-21 04:28:32,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:32,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 94 states and 131 transitions. [2022-02-21 04:28:32,104 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2022-02-21 04:28:32,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-02-21 04:28:32,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 131 transitions. [2022-02-21 04:28:32,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:32,105 INFO L681 BuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-02-21 04:28:32,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states and 131 transitions. [2022-02-21 04:28:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-02-21 04:28:32,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:28:32,110 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:32,110 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:32,111 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:32,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:32,118 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2022-02-21 04:28:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2022-02-21 04:28:32,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:32,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:32,122 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:32,122 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:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:32,127 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2022-02-21 04:28:32,127 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 131 transitions. [2022-02-21 04:28:32,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:28:32,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:28:32,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:28:32,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:28:32,129 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:32,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 131 transitions. [2022-02-21 04:28:32,131 INFO L704 BuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-02-21 04:28:32,132 INFO L587 BuchiCegarLoop]: Abstraction has 94 states and 131 transitions. [2022-02-21 04:28:32,134 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:28:32,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 131 transitions. [2022-02-21 04:28:32,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 64 [2022-02-21 04:28:32,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:32,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:32,138 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:32,138 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:32,139 INFO L791 eck$LassoCheckResult]: Stem: 893#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(47, 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; 883#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; 884#L201 assume 0 == ~r1~0; 854#L202 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 >= 1; 855#L203 assume ~id1~0 >= 0; 870#L204 assume 0 == ~st1~0; 827#L205 assume ~send1~0 == ~id1~0; 828#L206 assume 0 == ~mode1~0 % 256; 816#L207 assume ~id2~0 >= 0; 817#L208 assume 0 == ~st2~0; 880#L209 assume ~send2~0 == ~id2~0; 831#L210 assume 0 == ~mode2~0 % 256; 832#L211 assume ~id3~0 >= 0; 821#L212 assume 0 == ~st3~0; 822#L213 assume ~send3~0 == ~id3~0; 895#L214 assume 0 == ~mode3~0 % 256; 896#L215 assume ~id4~0 >= 0; 879#L216 assume 0 == ~st4~0; 858#L217 assume ~send4~0 == ~id4~0; 859#L218 assume 0 == ~mode4~0 % 256; 887#L219 assume ~id1~0 != ~id2~0; 898#L220 assume ~id1~0 != ~id3~0; 850#L221 assume ~id1~0 != ~id4~0; 846#L222 assume ~id2~0 != ~id3~0; 847#L223 assume ~id2~0 != ~id4~0; 837#L224 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 838#L201-1 init_#res#1 := init_~tmp~0#1; 867#L298 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; 875#L350 assume !(0 == main_~i2~0#1); 878#L350-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; 862#L360-2 [2022-02-21 04:28:32,139 INFO L793 eck$LassoCheckResult]: Loop: 862#L360-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; 863#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; 839#L69 assume !(node1_~m1~0#1 != ~nomsg~0); 813#L69-1 ~mode1~0 := 0; 881#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; 882#L100 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 891#L103 assume !(node2_~m2~0#1 != ~nomsg~0); 852#L103-1 ~mode2~0 := 0; 876#L100-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; 877#L134 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 894#L137 assume !(node3_~m3~0#1 != ~nomsg~0); 835#L137-1 ~mode3~0 := 0; 836#L134-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; 809#L168 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 811#L171 assume !(node4_~m4~0#1 != ~nomsg~0); 866#L171-1 ~mode4~0 := 0; 825#L168-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; 833#L306 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 834#L307 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 815#L306-1 check_#res#1 := check_~tmp~1#1; 889#L318 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; 892#L387 assume !(0 == assert_~arg#1 % 256); 890#L382 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; 862#L360-2 [2022-02-21 04:28:32,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:32,144 INFO L85 PathProgramCache]: Analyzing trace with hash -805895157, now seen corresponding path program 2 times [2022-02-21 04:28:32,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:32,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907060680] [2022-02-21 04:28:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:32,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:32,178 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:32,213 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2027257471, now seen corresponding path program 1 times [2022-02-21 04:28:32,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:32,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005661049] [2022-02-21 04:28:32,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:32,227 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:28:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:28:32,257 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:28:32,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:32,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2125885643, now seen corresponding path program 1 times [2022-02-21 04:28:32,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:28:32,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810657699] [2022-02-21 04:28:32,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:28:32,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:28:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:32,349 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(47, 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:32,349 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:32,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1094#true} assume 0 == ~r1~0; {1094#true} is VALID [2022-02-21 04:28:32,350 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:32,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {1094#true} assume ~id1~0 >= 0; {1094#true} is VALID [2022-02-21 04:28:32,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {1094#true} assume 0 == ~st1~0; {1094#true} is VALID [2022-02-21 04:28:32,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {1094#true} assume ~send1~0 == ~id1~0; {1094#true} is VALID [2022-02-21 04:28:32,353 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:32,355 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:32,355 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:32,356 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:32,357 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:32,357 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:32,358 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:32,358 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:32,359 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:32,359 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:32,360 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:32,360 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:32,361 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:32,362 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:32,362 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:32,363 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:32,363 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:32,364 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:32,364 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:32,365 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:32,365 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:32,366 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:32,367 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:32,367 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:32,368 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:32,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {1095#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:32,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {1095#false} ~mode1~0 := 0; {1095#false} is VALID [2022-02-21 04:28:32,369 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:32,369 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:32,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {1095#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:32,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {1095#false} ~mode2~0 := 0; {1095#false} is VALID [2022-02-21 04:28:32,370 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:32,370 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:32,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {1095#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:32,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {1095#false} ~mode3~0 := 0; {1095#false} is VALID [2022-02-21 04:28:32,371 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:32,371 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:32,371 INFO L290 TraceCheckUtils]: 44: Hoare triple {1095#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1095#false} is VALID [2022-02-21 04:28:32,371 INFO L290 TraceCheckUtils]: 45: Hoare triple {1095#false} ~mode4~0 := 0; {1095#false} is VALID [2022-02-21 04:28:32,371 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:32,372 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:32,372 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:32,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {1095#false} check_#res#1 := check_~tmp~1#1; {1095#false} is VALID [2022-02-21 04:28:32,372 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:32,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {1095#false} assume !(0 == assert_~arg#1 % 256); {1095#false} is VALID [2022-02-21 04:28:32,373 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:32,374 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:32,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:28:32,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810657699] [2022-02-21 04:28:32,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810657699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:28:32,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:28:32,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:28:32,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344437986] [2022-02-21 04:28:32,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:28:33,217 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:33,218 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:33,218 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:33,219 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:33,219 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:28:33,219 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:33,219 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:33,219 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:33,219 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:28:33,220 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:33,220 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:33,243 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:33,252 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:33,258 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:33,286 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:33,289 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:33,291 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:33,296 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:33,298 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:33,301 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:33,303 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:33,308 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:33,314 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:33,317 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:33,329 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:33,332 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:33,334 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:33,336 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:33,341 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:33,346 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:33,348 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:34,031 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:34,032 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:28:34,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:34,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:34,039 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:34,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:28:34,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:34,065 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:34,105 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:34,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:34,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:34,107 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:34,114 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:34,115 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:28:34,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:28:34,273 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:28:34,277 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:34,277 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:28:34,277 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:28:34,277 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:28:34,278 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:28:34,278 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:28:34,278 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:34,278 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:28:34,278 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:28:34,278 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:28:34,278 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:28:34,278 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:28:34,282 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:34,288 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:34,293 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:34,295 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:34,299 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:34,301 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:34,303 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:34,305 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:34,322 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:34,349 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:34,353 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:34,366 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:34,371 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:34,373 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:34,377 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:34,379 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:34,383 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:34,385 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:34,387 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:34,394 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:35,012 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:28:35,015 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:28:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:35,017 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:35,018 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:35,020 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:35,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:35,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:35,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:35,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:35,027 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:35,029 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:35,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:35,031 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:35,047 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:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:35,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:35,048 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:35,049 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:35,051 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:35,058 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:35,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:35,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:35,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:35,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:35,060 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:35,060 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:35,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:35,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:28:35,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:35,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:35,114 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:35,116 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:35,116 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:35,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:35,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:35,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:35,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:35,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:35,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:35,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:35,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:28:35,150 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:35,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:35,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:35,152 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:35,153 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:35,153 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:35,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:28:35,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:28:35,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:28:35,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:28:35,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:28:35,162 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:28:35,162 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:28:35,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:28:35,168 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:28:35,168 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:28:35,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:28:35,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:28:35,183 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:35,207 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:28:35,208 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:28:35,208 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:28:35,208 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:35,230 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:35,231 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:35,240 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:28:35,246 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:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:35,302 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:35,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:28:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:35,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:28:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:35,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:35,447 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(47, 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:35,447 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:35,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {1097#unseeded} assume 0 == ~r1~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,448 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:35,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {1097#unseeded} assume ~id1~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:35,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {1097#unseeded} assume 0 == ~st1~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {1097#unseeded} assume ~send1~0 == ~id1~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {1097#unseeded} assume 0 == ~mode1~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:35,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#unseeded} assume ~id2~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:35,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#unseeded} assume 0 == ~st2~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#unseeded} assume ~send2~0 == ~id2~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {1097#unseeded} assume 0 == ~mode2~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:35,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {1097#unseeded} assume ~id3~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:35,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1097#unseeded} assume 0 == ~st3~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {1097#unseeded} assume ~send3~0 == ~id3~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#unseeded} assume 0 == ~mode3~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:35,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {1097#unseeded} assume ~id4~0 >= 0; {1097#unseeded} is VALID [2022-02-21 04:28:35,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {1097#unseeded} assume 0 == ~st4~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {1097#unseeded} assume ~send4~0 == ~id4~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {1097#unseeded} assume 0 == ~mode4~0 % 256; {1097#unseeded} is VALID [2022-02-21 04:28:35,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {1097#unseeded} assume ~id1~0 != ~id2~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {1097#unseeded} assume ~id1~0 != ~id3~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {1097#unseeded} assume ~id1~0 != ~id4~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,456 INFO L290 TraceCheckUtils]: 23: Hoare triple {1097#unseeded} assume ~id2~0 != ~id3~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,456 INFO L290 TraceCheckUtils]: 24: Hoare triple {1097#unseeded} assume ~id2~0 != ~id4~0; {1097#unseeded} is VALID [2022-02-21 04:28:35,456 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:35,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {1097#unseeded} init_#res#1 := init_~tmp~0#1; {1097#unseeded} is VALID [2022-02-21 04:28:35,457 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:35,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {1097#unseeded} assume !(0 == main_~i2~0#1); {1097#unseeded} is VALID [2022-02-21 04:28:35,458 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:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:35,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:28:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:28:35,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:28:35,706 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:35,707 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:35,707 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:35,708 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:35,708 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:35,709 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:35,709 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:35,710 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:35,710 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:35,711 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:35,711 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:35,712 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:35,712 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:35,713 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:35,713 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:35,714 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:35,715 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:35,715 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:35,716 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:35,716 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:35,717 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:35,717 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:35,718 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:35,718 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:35,720 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:35,737 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:35,738 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:35,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:35,742 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:35,743 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:35,956 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:35,957 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:35,957 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:35,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 131 transitions. cyclomatic complexity: 38 [2022-02-21 04:28:35,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:35,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:35,957 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:35,962 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:35,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:28:35,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:28:35,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 233 transitions. [2022-02-21 04:28:35,965 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:35,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:35,968 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 94 states and 131 transitions. cyclomatic complexity: 38 [2022-02-21 04:28:35,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 64 examples of accepted words. [2022-02-21 04:28:35,998 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:36,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:28:36,001 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:28:36,001 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 158 states and 233 transitions. cyclomatic complexity: 76 [2022-02-21 04:28:36,002 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158 states and 233 transitions. cyclomatic complexity: 76 [2022-02-21 04:28:36,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:36,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:28:36,002 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:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,003 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:36,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,005 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:36,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,007 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:36,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,007 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:36,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,008 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:36,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,008 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:36,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,008 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:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,009 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:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,009 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:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,009 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:36,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,010 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:36,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,010 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:36,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,010 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:36,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,010 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:36,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,011 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:36,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,011 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:36,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,011 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:36,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,013 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:36,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,013 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:36,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,014 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:36,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,014 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:36,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,015 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:36,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,015 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:36,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,016 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:36,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,016 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:36,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,016 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:36,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,017 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:36,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,017 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:36,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,018 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:36,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,018 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:36,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,018 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:36,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,019 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:36,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,019 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:36,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,020 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:36,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,020 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:36,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,021 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:36,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,021 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:36,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,021 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:36,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,022 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:36,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,022 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:36,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,023 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:36,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,023 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:36,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,024 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:36,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,024 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:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,025 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:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,025 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:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,025 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:36,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,026 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:36,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,026 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:36,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,027 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:36,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,027 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:36,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,028 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:36,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,028 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:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,029 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:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,029 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:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,029 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:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,030 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:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,030 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:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,031 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:36,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,031 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:36,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,033 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:36,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,033 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:36,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,034 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:36,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,034 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:36,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,035 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:36,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,035 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:36,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,036 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:36,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,036 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:36,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,036 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:36,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,037 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:36,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,037 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:36,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,038 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:36,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,038 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:36,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,038 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:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,039 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:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,039 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:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,040 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:36,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,040 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:36,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,040 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:36,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,041 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:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,042 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:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,042 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:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,043 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:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,043 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:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,044 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:36,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,044 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:36,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,045 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:36,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,046 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:36,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,047 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:36,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,047 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:36,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,047 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:36,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,048 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:36,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,048 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:36,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,049 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:36,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,049 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:36,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,049 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:36,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,050 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:36,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,050 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:36,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,050 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:36,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,051 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:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,052 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:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,052 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:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,053 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:36,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,053 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:36,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,053 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:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,054 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:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,054 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:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,055 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:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,055 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:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,055 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:36,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,056 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:36,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,056 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:36,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,057 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:36,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,057 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:36,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,057 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:36,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,058 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:36,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,058 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:36,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,058 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:36,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,059 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:36,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,059 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:36,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,060 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:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,060 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:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,060 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:36,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,061 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:36,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,062 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:36,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,063 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:36,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,064 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:36,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,064 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:36,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,064 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:36,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,065 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:36,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,065 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:36,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,066 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:36,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,066 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:36,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,066 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:36,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,067 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:36,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,067 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:36,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,067 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:36,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,068 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:36,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,068 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:36,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,068 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:36,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,069 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:36,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,069 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:36,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,070 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:36,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,075 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:36,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,076 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:36,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,076 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:36,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,077 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:36,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,077 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:36,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,078 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:36,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,078 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:36,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,079 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:36,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,079 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:36,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,079 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:36,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,080 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:36,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,080 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:36,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,081 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:36,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,081 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:36,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,081 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:36,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,090 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:36,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,090 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:36,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,091 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:36,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,091 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:36,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,092 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:36,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,092 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:36,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,092 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:36,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,093 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:36,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,093 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:36,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,093 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:36,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,094 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:36,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,094 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:36,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,095 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:36,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,095 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:36,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,096 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:36,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,096 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:36,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,096 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:36,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,097 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:36,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,097 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:36,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,097 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:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,098 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:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,098 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:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,099 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:36,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,099 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:36,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,099 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:36,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,100 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:36,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,100 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:36,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,100 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:36,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,101 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:36,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,102 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:36,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,103 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:36,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,103 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:36,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,104 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:36,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,104 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:36,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,104 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:36,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,105 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:36,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,105 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:36,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,105 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:36,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,106 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:36,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,106 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:36,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,107 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:36,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,107 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:36,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,108 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:36,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,108 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:36,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,108 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:36,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,109 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:36,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,109 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:36,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,109 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:36,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,110 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:36,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,110 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:36,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,110 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:36,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,111 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:28:36,112 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:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-21 04:28:36,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 23 letters. [2022-02-21 04:28:36,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 53 letters. Loop has 23 letters. [2022-02-21 04:28:36,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 131 transitions. Stem has 30 letters. Loop has 46 letters. [2022-02-21 04:28:36,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:28:36,116 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158 states and 233 transitions. cyclomatic complexity: 76 [2022-02-21 04:28:36,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:36,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158 states to 0 states and 0 transitions. [2022-02-21 04:28:36,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:36,121 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:36,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:36,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:36,121 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:36,121 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:36,122 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:28:36,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:28:36,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:28:36,124 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:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:28:36,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:28:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:28:36,124 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:36,173 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:36,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:28:36,174 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:36,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:28:36,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:28:36,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:28:36,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:28:36,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:28:36,175 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:36,175 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:36,175 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:28:36,175 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:28:36,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:28:36,175 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:28:36,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:28:36,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:28:36 BoogieIcfgContainer [2022-02-21 04:28:36,182 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:28:36,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:28:36,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:28:36,183 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:28:36,183 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:30" (3/4) ... [2022-02-21 04:28:36,185 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:28:36,186 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:28:36,187 INFO L158 Benchmark]: Toolchain (without parser) took 7042.32ms. Allocated memory was 94.4MB in the beginning and 176.2MB in the end (delta: 81.8MB). Free memory was 61.4MB in the beginning and 133.5MB in the end (delta: -72.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-02-21 04:28:36,187 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:36,188 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.07ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 64.8MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:28:36,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.53ms. Allocated memory is still 94.4MB. Free memory was 64.8MB in the beginning and 61.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:36,192 INFO L158 Benchmark]: Boogie Preprocessor took 23.52ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 59.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:28:36,193 INFO L158 Benchmark]: RCFGBuilder took 687.64ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 59.7MB in the beginning and 99.0MB in the end (delta: -39.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. [2022-02-21 04:28:36,193 INFO L158 Benchmark]: BuchiAutomizer took 5829.42ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 98.4MB in the beginning and 133.5MB in the end (delta: -35.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2022-02-21 04:28:36,193 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 176.2MB. Free memory is still 133.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:28:36,202 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.20ms. Allocated memory is still 94.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.07ms. Allocated memory is still 94.4MB. Free memory was 61.3MB in the beginning and 64.8MB in the end (delta: -3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.53ms. Allocated memory is still 94.4MB. Free memory was 64.8MB in the beginning and 61.7MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.52ms. Allocated memory is still 94.4MB. Free memory was 61.5MB in the beginning and 59.7MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 687.64ms. Allocated memory was 94.4MB in the beginning and 132.1MB in the end (delta: 37.7MB). Free memory was 59.7MB in the beginning and 99.0MB in the end (delta: -39.3MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 5829.42ms. Allocated memory was 132.1MB in the beginning and 176.2MB in the end (delta: 44.0MB). Free memory was 98.4MB in the beginning and 133.5MB in the end (delta: -35.1MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 176.2MB. Free memory is still 133.5MB. 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.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.8s. Construction of modules took 0.0s. Büchi inclusion checks took 1.6s. 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: 15ms 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:36,242 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