/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:28:18,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:28:18,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:28:18,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:28:18,102 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:28:18,103 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:28:18,104 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:28:18,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:28:18,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:28:18,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:28:18,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:28:18,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:28:18,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:28:18,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:28:18,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:28:18,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:28:18,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:28:18,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:28:18,113 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:28:18,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:28:18,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:28:18,117 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:28:18,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:28:18,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:28:18,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:28:18,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:28:18,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:28:18,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:28:18,122 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:28:18,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:28:18,123 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:28:18,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:28:18,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:28:18,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:28:18,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:28:18,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:28:18,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:28:18,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:28:18,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:28:18,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:28:18,135 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:28:18,135 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 22:28:18,163 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:28:18,163 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:28:18,164 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:28:18,164 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:28:18,164 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:28:18,164 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:28:18,164 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:28:18,165 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:28:18,165 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:28:18,165 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:28:18,165 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:28:18,165 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:28:18,165 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:28:18,165 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:28:18,166 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:28:18,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:28:18,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:28:18,167 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:28:18,167 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:28:18,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:28:18,168 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:28:18,168 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:28:18,168 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-09-20 22:28:18,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:28:18,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:28:18,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:28:18,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:28:18,399 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:28:18,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:28:18,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5afcd6b/2f9c94b900b2499686eda877e4e8a52e/FLAG53ac802e8 [2022-09-20 22:28:18,826 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:28:18,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:28:18,840 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5afcd6b/2f9c94b900b2499686eda877e4e8a52e/FLAG53ac802e8 [2022-09-20 22:28:19,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5afcd6b/2f9c94b900b2499686eda877e4e8a52e [2022-09-20 22:28:19,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:28:19,201 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:28:19,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:28:19,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:28:19,205 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:28:19,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d7b041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19, skipping insertion in model container [2022-09-20 22:28:19,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:28:19,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:28:19,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:28:19,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:28:19,604 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:28:19,615 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-09-20 22:28:19,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:28:19,677 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:28:19,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19 WrapperNode [2022-09-20 22:28:19,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:28:19,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:28:19,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:28:19,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:28:19,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,721 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 193 [2022-09-20 22:28:19,721 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:28:19,722 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:28:19,722 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:28:19,722 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:28:19,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,736 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,747 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:28:19,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:28:19,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:28:19,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:28:19,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (1/1) ... [2022-09-20 22:28:19,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:28:19,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:28:19,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 22:28:19,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 22:28:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:28:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:28:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:28:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:28:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:28:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:28:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:28:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:28:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:28:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:28:19,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:28:19,817 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:28:19,911 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:28:19,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:28:20,376 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:28:20,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:28:20,601 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:28:20,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:28:20 BoogieIcfgContainer [2022-09-20 22:28:20,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:28:20,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:28:20,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:28:20,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:28:20,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:28:19" (1/3) ... [2022-09-20 22:28:20,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489c373f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:28:20, skipping insertion in model container [2022-09-20 22:28:20,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:28:19" (2/3) ... [2022-09-20 22:28:20,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@489c373f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:28:20, skipping insertion in model container [2022-09-20 22:28:20,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:28:20" (3/3) ... [2022-09-20 22:28:20,609 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-09-20 22:28:20,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:28:20,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:28:20,621 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:28:20,678 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:28:20,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-09-20 22:28:20,765 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-09-20 22:28:20,765 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:28:20,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 72 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-09-20 22:28:20,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-09-20 22:28:20,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-09-20 22:28:20,785 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:28:20,792 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@23581b55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:28:20,826 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:28:20,833 INFO L130 PetriNetUnfolder]: 0/51 cut-off events. [2022-09-20 22:28:20,834 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:28:20,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:20,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:28:20,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:20,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:20,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1951185825, now seen corresponding path program 1 times [2022-09-20 22:28:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:20,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778883386] [2022-09-20 22:28:20,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:21,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:21,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778883386] [2022-09-20 22:28:21,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778883386] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:21,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:21,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:28:21,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294834467] [2022-09-20 22:28:21,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:21,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:28:21,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:28:21,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:28:21,117 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 139 [2022-09-20 22:28:21,120 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 135 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-09-20 22:28:21,120 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:21,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 139 [2022-09-20 22:28:21,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:21,353 INFO L130 PetriNetUnfolder]: 162/623 cut-off events. [2022-09-20 22:28:21,354 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-09-20 22:28:21,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 623 events. 162/623 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3449 event pairs, 132 based on Foata normal form. 46/627 useless extension candidates. Maximal degree in co-relation 871. Up to 191 conditions per place. [2022-09-20 22:28:21,363 INFO L137 encePairwiseOnDemand]: 134/139 looper letters, 18 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2022-09-20 22:28:21,364 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 139 transitions, 339 flow [2022-09-20 22:28:21,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:28:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:28:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2022-09-20 22:28:21,377 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9448441247002398 [2022-09-20 22:28:21,378 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2022-09-20 22:28:21,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2022-09-20 22:28:21,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:21,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2022-09-20 22:28:21,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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-09-20 22:28:21,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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-09-20 22:28:21,392 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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-09-20 22:28:21,394 INFO L175 Difference]: Start difference. First operand has 146 places, 135 transitions, 282 flow. Second operand 3 states and 394 transitions. [2022-09-20 22:28:21,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 139 transitions, 339 flow [2022-09-20 22:28:21,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 139 transitions, 332 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:28:21,400 INFO L231 Difference]: Finished difference. Result has 142 places, 131 transitions, 274 flow [2022-09-20 22:28:21,402 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=142, PETRI_TRANSITIONS=131} [2022-09-20 22:28:21,407 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, -4 predicate places. [2022-09-20 22:28:21,407 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 131 transitions, 274 flow [2022-09-20 22:28:21,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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-09-20 22:28:21,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:21,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:21,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:28:21,409 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:21,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 771760905, now seen corresponding path program 1 times [2022-09-20 22:28:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:21,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538856880] [2022-09-20 22:28:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:21,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:21,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:21,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:21,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538856880] [2022-09-20 22:28:21,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538856880] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:21,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:21,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:28:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623072116] [2022-09-20 22:28:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:28:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:28:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:28:21,628 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-09-20 22:28:21,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 131 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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-09-20 22:28:21,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:21,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-09-20 22:28:21,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:25,374 INFO L130 PetriNetUnfolder]: 15341/33340 cut-off events. [2022-09-20 22:28:25,375 INFO L131 PetriNetUnfolder]: For 1279/1279 co-relation queries the response was YES. [2022-09-20 22:28:25,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55802 conditions, 33340 events. 15341/33340 cut-off events. For 1279/1279 co-relation queries the response was YES. Maximal size of possible extension queue 1472. Compared 353722 event pairs, 3240 based on Foata normal form. 0/32608 useless extension candidates. Maximal degree in co-relation 55741. Up to 7696 conditions per place. [2022-09-20 22:28:25,552 INFO L137 encePairwiseOnDemand]: 125/139 looper letters, 37 selfloop transitions, 10 changer transitions 96/232 dead transitions. [2022-09-20 22:28:25,552 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 232 transitions, 754 flow [2022-09-20 22:28:25,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:28:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:28:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1086 transitions. [2022-09-20 22:28:25,555 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.86810551558753 [2022-09-20 22:28:25,555 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1086 transitions. [2022-09-20 22:28:25,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1086 transitions. [2022-09-20 22:28:25,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:25,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1086 transitions. [2022-09-20 22:28:25,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 120.66666666666667) internal successors, (1086), 9 states have internal predecessors, (1086), 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-09-20 22:28:25,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 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-09-20 22:28:25,560 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 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-09-20 22:28:25,560 INFO L175 Difference]: Start difference. First operand has 142 places, 131 transitions, 274 flow. Second operand 9 states and 1086 transitions. [2022-09-20 22:28:25,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 232 transitions, 754 flow [2022-09-20 22:28:25,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 232 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:28:25,563 INFO L231 Difference]: Finished difference. Result has 156 places, 124 transitions, 366 flow [2022-09-20 22:28:25,564 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=366, PETRI_PLACES=156, PETRI_TRANSITIONS=124} [2022-09-20 22:28:25,564 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 10 predicate places. [2022-09-20 22:28:25,565 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 124 transitions, 366 flow [2022-09-20 22:28:25,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.66666666666667) internal successors, (652), 6 states have internal predecessors, (652), 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-09-20 22:28:25,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:25,565 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:25,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:28:25,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:25,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:25,566 INFO L85 PathProgramCache]: Analyzing trace with hash -562955512, now seen corresponding path program 1 times [2022-09-20 22:28:25,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:25,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308574267] [2022-09-20 22:28:25,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:25,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:25,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:25,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308574267] [2022-09-20 22:28:25,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308574267] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:25,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:25,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:28:25,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697447720] [2022-09-20 22:28:25,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:25,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:28:25,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:25,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:28:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:28:25,697 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-09-20 22:28:25,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 124 transitions, 366 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:28:25,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:25,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-09-20 22:28:25,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:28,307 INFO L130 PetriNetUnfolder]: 10966/19304 cut-off events. [2022-09-20 22:28:28,307 INFO L131 PetriNetUnfolder]: For 31431/31442 co-relation queries the response was YES. [2022-09-20 22:28:28,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56838 conditions, 19304 events. 10966/19304 cut-off events. For 31431/31442 co-relation queries the response was YES. Maximal size of possible extension queue 1007. Compared 159392 event pairs, 1090 based on Foata normal form. 330/19317 useless extension candidates. Maximal degree in co-relation 56765. Up to 6304 conditions per place. [2022-09-20 22:28:28,413 INFO L137 encePairwiseOnDemand]: 124/139 looper letters, 45 selfloop transitions, 15 changer transitions 106/255 dead transitions. [2022-09-20 22:28:28,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 255 transitions, 1390 flow [2022-09-20 22:28:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:28:28,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:28:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1534 transitions. [2022-09-20 22:28:28,417 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8489208633093526 [2022-09-20 22:28:28,417 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1534 transitions. [2022-09-20 22:28:28,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1534 transitions. [2022-09-20 22:28:28,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:28,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1534 transitions. [2022-09-20 22:28:28,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.0) internal successors, (1534), 13 states have internal predecessors, (1534), 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-09-20 22:28:28,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:28,423 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:28,423 INFO L175 Difference]: Start difference. First operand has 156 places, 124 transitions, 366 flow. Second operand 13 states and 1534 transitions. [2022-09-20 22:28:28,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 255 transitions, 1390 flow [2022-09-20 22:28:28,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 255 transitions, 1300 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:28:28,446 INFO L231 Difference]: Finished difference. Result has 158 places, 131 transitions, 500 flow [2022-09-20 22:28:28,447 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=500, PETRI_PLACES=158, PETRI_TRANSITIONS=131} [2022-09-20 22:28:28,447 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 12 predicate places. [2022-09-20 22:28:28,447 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 131 transitions, 500 flow [2022-09-20 22:28:28,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:28:28,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:28,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:28,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:28:28,448 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:28,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1426374122, now seen corresponding path program 1 times [2022-09-20 22:28:28,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:28,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393085276] [2022-09-20 22:28:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:28,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:28,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393085276] [2022-09-20 22:28:28,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393085276] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:28,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:28,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:28:28,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396331897] [2022-09-20 22:28:28,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:28,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:28:28,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:28:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:28:28,701 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-09-20 22:28:28,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 131 transitions, 500 flow. Second operand has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:28:28,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:28,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-09-20 22:28:28,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:31,467 INFO L130 PetriNetUnfolder]: 10502/18262 cut-off events. [2022-09-20 22:28:31,468 INFO L131 PetriNetUnfolder]: For 68160/68181 co-relation queries the response was YES. [2022-09-20 22:28:31,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64568 conditions, 18262 events. 10502/18262 cut-off events. For 68160/68181 co-relation queries the response was YES. Maximal size of possible extension queue 987. Compared 149265 event pairs, 1730 based on Foata normal form. 360/18433 useless extension candidates. Maximal degree in co-relation 64479. Up to 5682 conditions per place. [2022-09-20 22:28:31,620 INFO L137 encePairwiseOnDemand]: 125/139 looper letters, 54 selfloop transitions, 20 changer transitions 112/275 dead transitions. [2022-09-20 22:28:31,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 275 transitions, 1816 flow [2022-09-20 22:28:31,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:28:31,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:28:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1541 transitions. [2022-09-20 22:28:31,624 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8527946873270614 [2022-09-20 22:28:31,624 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1541 transitions. [2022-09-20 22:28:31,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1541 transitions. [2022-09-20 22:28:31,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:31,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1541 transitions. [2022-09-20 22:28:31,627 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.53846153846153) internal successors, (1541), 13 states have internal predecessors, (1541), 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-09-20 22:28:31,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:31,630 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:31,630 INFO L175 Difference]: Start difference. First operand has 158 places, 131 transitions, 500 flow. Second operand 13 states and 1541 transitions. [2022-09-20 22:28:31,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 275 transitions, 1816 flow [2022-09-20 22:28:31,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 275 transitions, 1768 flow, removed 24 selfloop flow, removed 0 redundant places. [2022-09-20 22:28:31,944 INFO L231 Difference]: Finished difference. Result has 173 places, 141 transitions, 714 flow [2022-09-20 22:28:31,944 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=714, PETRI_PLACES=173, PETRI_TRANSITIONS=141} [2022-09-20 22:28:31,944 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 27 predicate places. [2022-09-20 22:28:31,944 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 141 transitions, 714 flow [2022-09-20 22:28:31,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.42857142857143) internal successors, (759), 7 states have internal predecessors, (759), 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-09-20 22:28:31,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:31,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:31,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:28:31,945 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash -90444721, now seen corresponding path program 1 times [2022-09-20 22:28:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:31,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078312601] [2022-09-20 22:28:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:31,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:32,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:32,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:32,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078312601] [2022-09-20 22:28:32,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078312601] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:32,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:32,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:28:32,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978702960] [2022-09-20 22:28:32,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:32,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:28:32,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:32,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:28:32,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:28:32,053 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 139 [2022-09-20 22:28:32,053 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 141 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-09-20 22:28:32,053 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:32,053 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 139 [2022-09-20 22:28:32,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:34,031 INFO L130 PetriNetUnfolder]: 6151/11255 cut-off events. [2022-09-20 22:28:34,031 INFO L131 PetriNetUnfolder]: For 57092/59123 co-relation queries the response was YES. [2022-09-20 22:28:34,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41043 conditions, 11255 events. 6151/11255 cut-off events. For 57092/59123 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 93285 event pairs, 1558 based on Foata normal form. 733/11425 useless extension candidates. Maximal degree in co-relation 40978. Up to 4056 conditions per place. [2022-09-20 22:28:34,208 INFO L137 encePairwiseOnDemand]: 133/139 looper letters, 24 selfloop transitions, 4 changer transitions 46/192 dead transitions. [2022-09-20 22:28:34,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 192 transitions, 1126 flow [2022-09-20 22:28:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:28:34,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:28:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1101 transitions. [2022-09-20 22:28:34,211 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8800959232613909 [2022-09-20 22:28:34,211 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1101 transitions. [2022-09-20 22:28:34,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1101 transitions. [2022-09-20 22:28:34,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:34,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1101 transitions. [2022-09-20 22:28:34,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.33333333333333) internal successors, (1101), 9 states have internal predecessors, (1101), 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-09-20 22:28:34,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 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-09-20 22:28:34,216 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 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-09-20 22:28:34,217 INFO L175 Difference]: Start difference. First operand has 173 places, 141 transitions, 714 flow. Second operand 9 states and 1101 transitions. [2022-09-20 22:28:34,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 192 transitions, 1126 flow [2022-09-20 22:28:34,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 192 transitions, 1082 flow, removed 22 selfloop flow, removed 6 redundant places. [2022-09-20 22:28:34,460 INFO L231 Difference]: Finished difference. Result has 173 places, 141 transitions, 712 flow [2022-09-20 22:28:34,461 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=712, PETRI_PLACES=173, PETRI_TRANSITIONS=141} [2022-09-20 22:28:34,461 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 27 predicate places. [2022-09-20 22:28:34,461 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 141 transitions, 712 flow [2022-09-20 22:28:34,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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-09-20 22:28:34,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:34,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:34,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:28:34,462 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:34,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1985968552, now seen corresponding path program 1 times [2022-09-20 22:28:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530522557] [2022-09-20 22:28:34,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:34,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:34,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530522557] [2022-09-20 22:28:34,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530522557] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:34,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:34,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:28:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143882489] [2022-09-20 22:28:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:34,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:28:34,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:34,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:28:34,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:28:34,535 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-09-20 22:28:34,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 141 transitions, 712 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-09-20 22:28:34,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:34,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-09-20 22:28:34,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:37,263 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][159], [278#true, 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 93#L879true, Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:37,264 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-09-20 22:28:37,264 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:28:37,264 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:28:37,264 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-09-20 22:28:38,154 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][159], [278#true, 88#L880-1true, 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:38,155 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-09-20 22:28:38,155 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-09-20 22:28:38,155 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-09-20 22:28:38,155 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-09-20 22:28:38,552 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][159], [278#true, 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 72#L2true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:38,553 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-09-20 22:28:38,553 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:28:38,553 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:28:38,553 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-09-20 22:28:39,229 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][159], [278#true, 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 64#L3true, Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:39,230 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-09-20 22:28:39,230 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-09-20 22:28:39,230 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-09-20 22:28:39,230 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-09-20 22:28:39,495 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][202], [283#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 140#L3-1true, Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:39,496 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,496 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,496 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,496 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,497 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][159], [278#true, 30#L2-1true, 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:39,497 INFO L383 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,497 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,498 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:28:39,498 INFO L386 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-09-20 22:28:40,147 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1137] L829-->L845: Formula: (let ((.cse31 (= (mod v_~b$w_buff1_used~0_344 256) 0)) (.cse28 (= (mod v_~b$r_buff0_thd4~0_228 256) 0)) (.cse10 (= (mod v_~b$r_buff1_thd4~0_155 256) 0))) (let ((.cse1 (= 0 (mod v_~weak$$choice2~0_78 256))) (.cse13 (= (mod v_~b$w_buff1_used~0_343 256) 0)) (.cse18 (not .cse10)) (.cse12 (= (mod v_~b$w_buff0_used~0_495 256) 0)) (.cse23 (and .cse10 .cse28)) (.cse24 (and .cse31 .cse28)) (.cse8 (not .cse28)) (.cse30 (= (mod v_~b$w_buff0_used~0_496 256) 0))) (let ((.cse9 (or .cse30 .cse28)) (.cse4 (or (not .cse31) .cse8)) (.cse6 (not .cse30)) (.cse3 (or .cse30 .cse23 .cse24)) (.cse22 (or .cse12 .cse28)) (.cse5 (or .cse18 .cse8)) (.cse17 (not .cse12)) (.cse15 (not .cse13)) (.cse0 (not .cse1))) (and (or (and (= v_~b$mem_tmp~0_26 v_~b~0_180) .cse0) (and .cse1 (= v_~b~0_180 v_~__unbuffered_p3_EBX~0_10))) (= v_~b$mem_tmp~0_26 v_~b~0_182) (= |v_P3Thread1of1ForFork0_#t~nondet22_1| v_~weak$$choice2~0_78) (let ((.cse2 (= |v_P3_#t~ite28_69| |v_P3Thread1of1ForFork0_#t~ite28_1|))) (or (and (or (and .cse2 (= v_~b$w_buff1~0_131 |v_P3_#t~ite29_61|) .cse3) (and (= |v_P3_#t~ite28_69| |v_P3_#t~ite29_61|) .cse4 .cse5 .cse6 (let ((.cse7 (= v_~b$w_buff1~0_131 |v_P3_#t~ite28_69|))) (or (and .cse7 .cse8 .cse6) (and .cse7 .cse9))))) (= v_~b$w_buff1~0_130 |v_P3_#t~ite29_61|) .cse1) (and .cse2 .cse0 (= v_~b$w_buff1~0_131 v_~b$w_buff1~0_130) (= |v_P3_#t~ite29_61| |v_P3Thread1of1ForFork0_#t~ite29_1|)))) (= |v_P3Thread1of1ForFork0_#t~nondet21_1| v_~weak$$choice0~0_21) (= v_~b$flush_delayed~0_42 0) (let ((.cse14 (= |v_P3_#t~ite40_45| |v_P3Thread1of1ForFork0_#t~ite40_1|))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_154) .cse1 (let ((.cse11 (= (mod v_~b$r_buff0_thd4~0_227 256) 0))) (or (and (= |v_P3_#t~ite41_39| v_~b$r_buff1_thd4~0_155) (or (and .cse10 .cse11) .cse12 (and .cse11 .cse13)) .cse14) (let ((.cse16 (not .cse11))) (and (or .cse15 .cse16) (= |v_P3_#t~ite40_45| |v_P3_#t~ite41_39|) .cse17 (or .cse18 .cse16) (let ((.cse19 (= |v_P3_#t~ite40_45| 0))) (or (and .cse19 .cse17 .cse16) (and .cse19 (or .cse11 .cse12))))))))) (and (= |v_P3_#t~ite41_39| |v_P3Thread1of1ForFork0_#t~ite41_1|) .cse0 .cse14 (= v_~b$r_buff1_thd4~0_155 v_~b$r_buff1_thd4~0_154)))) (or (and (or (and (= v_~b$w_buff1~0_131 |v_P3_#t~ite23_71|) .cse9) (and (= |v_P3_#t~ite23_71| v_~b$w_buff0~0_110) .cse8 .cse6)) .cse4 .cse5 .cse6 (= |v_P3_#t~ite23_71| v_~__unbuffered_p3_EBX~0_10)) (and (= |v_P3_#t~ite23_71| |v_P3Thread1of1ForFork0_#t~ite23_1|) (= v_~b~0_182 v_~__unbuffered_p3_EBX~0_10) .cse3)) (let ((.cse20 (= |v_P3_#t~ite34_71| |v_P3Thread1of1ForFork0_#t~ite34_1|))) (or (and (= |v_P3_#t~ite35_67| |v_P3Thread1of1ForFork0_#t~ite35_1|) .cse0 .cse20 (= v_~b$w_buff1_used~0_344 v_~b$w_buff1_used~0_343)) (and (or (and (= |v_P3_#t~ite34_71| |v_P3_#t~ite35_67|) .cse4 .cse5 .cse17 (let ((.cse21 (= |v_P3_#t~ite34_71| 0))) (or (and .cse21 .cse8 .cse17) (and .cse21 .cse22)))) (and .cse20 (or .cse23 .cse24 .cse12) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_344))) (= |v_P3_#t~ite35_67| v_~b$w_buff1_used~0_343) .cse1))) (let ((.cse26 (= |v_P3_#t~ite25_67| |v_P3Thread1of1ForFork0_#t~ite25_1|))) (or (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_109) .cse1 (or (and (let ((.cse25 (= |v_P3_#t~ite25_67| v_~b$w_buff0~0_110))) (or (and .cse25 .cse9) (and .cse8 .cse25 .cse6))) .cse4 .cse5 .cse6 (= |v_P3_#t~ite25_67| |v_P3_#t~ite26_61|)) (and (= |v_P3_#t~ite26_61| v_~b$w_buff0~0_110) .cse26 .cse3))) (and .cse26 .cse0 (= |v_P3_#t~ite26_61| |v_P3Thread1of1ForFork0_#t~ite26_1|) (= v_~b$w_buff0~0_109 v_~b$w_buff0~0_110)))) (let ((.cse27 (= |v_P3_#t~ite31_87| |v_P3Thread1of1ForFork0_#t~ite31_1|))) (or (and (= v_~b$w_buff0_used~0_496 v_~b$w_buff0_used~0_495) .cse0 (= |v_P3_#t~ite32_81| |v_P3Thread1of1ForFork0_#t~ite32_1|) .cse27) (and (or (and (or (and (= |v_P3_#t~ite31_87| 0) .cse8 .cse6) (and (= |v_P3_#t~ite31_87| v_~b$w_buff0_used~0_496) .cse9)) .cse4 .cse5 (= |v_P3_#t~ite32_81| |v_P3_#t~ite31_87|) .cse6) (and (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_496) .cse27 .cse3)) (= |v_P3_#t~ite32_81| v_~b$w_buff0_used~0_495) .cse1))) (let ((.cse29 (= |v_P3_#t~ite37_49| |v_P3Thread1of1ForFork0_#t~ite37_1|))) (or (and (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_227) (or (and (or (and (= |v_P3_#t~ite37_49| 0) .cse8 .cse17) (and .cse22 (= |v_P3_#t~ite37_49| v_~b$r_buff0_thd4~0_228))) .cse5 (= |v_P3_#t~ite37_49| |v_P3_#t~ite38_41|) .cse17 (or .cse8 .cse15)) (and (or (and .cse13 .cse28) .cse23 .cse12) .cse29 (= |v_P3_#t~ite38_41| v_~b$r_buff0_thd4~0_228))) .cse1) (and (= v_~b$r_buff0_thd4~0_228 v_~b$r_buff0_thd4~0_227) (= |v_P3_#t~ite38_41| |v_P3Thread1of1ForFork0_#t~ite38_1|) .cse0 .cse29))))))) InVars {P3Thread1of1ForFork0_#t~ite41=|v_P3Thread1of1ForFork0_#t~ite41_1|, P3Thread1of1ForFork0_#t~ite40=|v_P3Thread1of1ForFork0_#t~ite40_1|, P3Thread1of1ForFork0_#t~nondet22=|v_P3Thread1of1ForFork0_#t~nondet22_1|, P3Thread1of1ForFork0_#t~nondet21=|v_P3Thread1of1ForFork0_#t~nondet21_1|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_496, ~b~0=v_~b~0_182, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_344, P3Thread1of1ForFork0_#t~ite29=|v_P3Thread1of1ForFork0_#t~ite29_1|, P3Thread1of1ForFork0_#t~ite28=|v_P3Thread1of1ForFork0_#t~ite28_1|, P3Thread1of1ForFork0_#t~ite38=|v_P3Thread1of1ForFork0_#t~ite38_1|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_1|, P3Thread1of1ForFork0_#t~ite26=|v_P3Thread1of1ForFork0_#t~ite26_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_155, ~b$w_buff1~0=v_~b$w_buff1~0_131, P3Thread1of1ForFork0_#t~ite25=|v_P3Thread1of1ForFork0_#t~ite25_1|, ~b$w_buff0~0=v_~b$w_buff0~0_110, P3Thread1of1ForFork0_#t~ite35=|v_P3Thread1of1ForFork0_#t~ite35_1|, P3Thread1of1ForFork0_#t~ite34=|v_P3Thread1of1ForFork0_#t~ite34_1|, P3Thread1of1ForFork0_#t~ite23=|v_P3Thread1of1ForFork0_#t~ite23_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_228, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_1|, P3Thread1of1ForFork0_#t~ite31=|v_P3Thread1of1ForFork0_#t~ite31_1|} OutVars{P3Thread1of1ForFork0_#t~ite42=|v_P3Thread1of1ForFork0_#t~ite42_1|, P3Thread1of1ForFork0_#t~ite30=|v_P3Thread1of1ForFork0_#t~ite30_1|, ~b$mem_tmp~0=v_~b$mem_tmp~0_26, P3Thread1of1ForFork0_#t~ite43=|v_P3Thread1of1ForFork0_#t~ite43_1|, ~b$flush_delayed~0=v_~b$flush_delayed~0_42, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_495, ~weak$$choice0~0=v_~weak$$choice0~0_21, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_343, ~b~0=v_~b~0_180, P3Thread1of1ForFork0_#t~ite39=|v_P3Thread1of1ForFork0_#t~ite39_1|, P3Thread1of1ForFork0_#t~ite27=|v_P3Thread1of1ForFork0_#t~ite27_1|, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_154, ~b$w_buff1~0=v_~b$w_buff1~0_130, P3Thread1of1ForFork0_#t~ite36=|v_P3Thread1of1ForFork0_#t~ite36_1|, ~b$w_buff0~0=v_~b$w_buff0~0_109, P3Thread1of1ForFork0_#t~ite24=|v_P3Thread1of1ForFork0_#t~ite24_1|, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_227, ~weak$$choice2~0=v_~weak$$choice2~0_78, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_1|} AuxVars[|v_P3_#t~ite29_61|, |v_P3_#t~ite26_61|, |v_P3_#t~ite37_49|, |v_P3_#t~ite31_87|, |v_P3_#t~ite28_69|, |v_P3_#t~ite25_67|, |v_P3_#t~ite23_71|, |v_P3_#t~ite38_41|, |v_P3_#t~ite32_81|, |v_P3_#t~ite41_39|, |v_P3_#t~ite35_67|, |v_P3_#t~ite34_71|, |v_P3_#t~ite40_45|] AssignedVars[P3Thread1of1ForFork0_#t~ite30, ~b$w_buff0_used~0, ~b$w_buff1_used~0, P3Thread1of1ForFork0_#t~ite39, P3Thread1of1ForFork0_#t~ite38, ~b$r_buff1_thd4~0, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#t~ite36, ~b$w_buff0~0, P3Thread1of1ForFork0_#t~ite35, ~b$r_buff0_thd4~0, P3Thread1of1ForFork0_#t~ite34, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32, P3Thread1of1ForFork0_#t~ite31, P3Thread1of1ForFork0_#t~ite42, P3Thread1of1ForFork0_#t~ite41, ~b$mem_tmp~0, P3Thread1of1ForFork0_#t~ite43, P3Thread1of1ForFork0_#t~ite40, ~b$flush_delayed~0, P3Thread1of1ForFork0_#t~nondet22, P3Thread1of1ForFork0_#t~nondet21, ~__unbuffered_p3_EBX~0, ~weak$$choice0~0, ~b~0, P3Thread1of1ForFork0_#t~ite29, P3Thread1of1ForFork0_#t~ite28, P3Thread1of1ForFork0_#t~ite27, ~b$w_buff1~0, P3Thread1of1ForFork0_#t~ite26, P3Thread1of1ForFork0_#t~ite25, P3Thread1of1ForFork0_#t~ite24, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~ite23][159], [278#true, 130#L887true, 218#true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 94#L766true, Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 89#L845true]) [2022-09-20 22:28:40,147 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-09-20 22:28:40,147 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:28:40,147 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:28:40,148 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-09-20 22:28:40,236 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1096] L887-->L890: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_2 0) (= v_~__unbuffered_p3_EBX~0_2 0) (= v_~__unbuffered_p3_EAX~0_2 1) (= 2 v_~z~0_4) (= 2 v_~x~0_4))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_2, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_2, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_2, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][214], [278#true, 218#true, 94#L766true, Black: 185#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 265#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 200#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 257#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), P3Thread1of1ForFork0InUse, Black: 194#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)) (= ~z~0 0)), Black: 190#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), P2Thread1of1ForFork2InUse, Black: 263#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 261#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 256#(= ~__unbuffered_p3_EAX~0 0), Black: 184#(= ~z~0 0), P0Thread1of1ForFork3InUse, 58#L890true, 92#L816true, 254#true, Black: 170#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 172#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), 34#L796true, 182#true, Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 220#(= ~x~0 0), Black: 240#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 236#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 159#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 221#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 234#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 238#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 12#L829true, Black: 226#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 230#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 228#(and (= ~x~0 0) (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 232#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|)))]) [2022-09-20 22:28:40,236 INFO L383 tUnfolder$Statistics]: this new event has 97 ancestors and is not cut-off event [2022-09-20 22:28:40,236 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2022-09-20 22:28:40,237 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2022-09-20 22:28:40,237 INFO L386 tUnfolder$Statistics]: existing Event has 97 ancestors and is not cut-off event [2022-09-20 22:28:40,557 INFO L130 PetriNetUnfolder]: 20079/35174 cut-off events. [2022-09-20 22:28:40,557 INFO L131 PetriNetUnfolder]: For 55981/66927 co-relation queries the response was YES. [2022-09-20 22:28:40,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87300 conditions, 35174 events. 20079/35174 cut-off events. For 55981/66927 co-relation queries the response was YES. Maximal size of possible extension queue 2235. Compared 323413 event pairs, 1325 based on Foata normal form. 1329/34514 useless extension candidates. Maximal degree in co-relation 87194. Up to 10673 conditions per place. [2022-09-20 22:28:41,135 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 101 selfloop transitions, 20 changer transitions 0/237 dead transitions. [2022-09-20 22:28:41,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 237 transitions, 1376 flow [2022-09-20 22:28:41,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:28:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:28:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1227 transitions. [2022-09-20 22:28:41,149 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8827338129496403 [2022-09-20 22:28:41,149 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1227 transitions. [2022-09-20 22:28:41,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1227 transitions. [2022-09-20 22:28:41,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:41,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1227 transitions. [2022-09-20 22:28:41,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.7) internal successors, (1227), 10 states have internal predecessors, (1227), 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-09-20 22:28:41,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 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-09-20 22:28:41,153 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 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-09-20 22:28:41,153 INFO L175 Difference]: Start difference. First operand has 173 places, 141 transitions, 712 flow. Second operand 10 states and 1227 transitions. [2022-09-20 22:28:41,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 237 transitions, 1376 flow [2022-09-20 22:28:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 237 transitions, 1290 flow, removed 39 selfloop flow, removed 15 redundant places. [2022-09-20 22:28:41,209 INFO L231 Difference]: Finished difference. Result has 167 places, 159 transitions, 811 flow [2022-09-20 22:28:41,209 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=811, PETRI_PLACES=167, PETRI_TRANSITIONS=159} [2022-09-20 22:28:41,209 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 21 predicate places. [2022-09-20 22:28:41,209 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 159 transitions, 811 flow [2022-09-20 22:28:41,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 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-09-20 22:28:41,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:41,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:41,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:28:41,210 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:41,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1894351346, now seen corresponding path program 1 times [2022-09-20 22:28:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:41,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395405309] [2022-09-20 22:28:41,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:41,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395405309] [2022-09-20 22:28:41,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395405309] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:41,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:41,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:28:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448253307] [2022-09-20 22:28:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:41,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:28:41,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:41,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:28:41,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:28:41,302 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 139 [2022-09-20 22:28:41,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 159 transitions, 811 flow. Second operand has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 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-09-20 22:28:41,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:41,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 139 [2022-09-20 22:28:41,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:45,352 INFO L130 PetriNetUnfolder]: 9467/24447 cut-off events. [2022-09-20 22:28:45,352 INFO L131 PetriNetUnfolder]: For 63917/68044 co-relation queries the response was YES. [2022-09-20 22:28:45,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75779 conditions, 24447 events. 9467/24447 cut-off events. For 63917/68044 co-relation queries the response was YES. Maximal size of possible extension queue 1518. Compared 290131 event pairs, 2633 based on Foata normal form. 502/23386 useless extension candidates. Maximal degree in co-relation 75675. Up to 4138 conditions per place. [2022-09-20 22:28:45,700 INFO L137 encePairwiseOnDemand]: 125/139 looper letters, 111 selfloop transitions, 46 changer transitions 13/277 dead transitions. [2022-09-20 22:28:45,700 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 277 transitions, 1971 flow [2022-09-20 22:28:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:28:45,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:28:45,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1519 transitions. [2022-09-20 22:28:45,703 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8406198118428334 [2022-09-20 22:28:45,703 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1519 transitions. [2022-09-20 22:28:45,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1519 transitions. [2022-09-20 22:28:45,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:45,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1519 transitions. [2022-09-20 22:28:45,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 116.84615384615384) internal successors, (1519), 13 states have internal predecessors, (1519), 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-09-20 22:28:45,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:45,708 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:45,709 INFO L175 Difference]: Start difference. First operand has 167 places, 159 transitions, 811 flow. Second operand 13 states and 1519 transitions. [2022-09-20 22:28:45,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 277 transitions, 1971 flow [2022-09-20 22:28:45,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 277 transitions, 1933 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-09-20 22:28:45,951 INFO L231 Difference]: Finished difference. Result has 188 places, 185 transitions, 1326 flow [2022-09-20 22:28:45,952 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1326, PETRI_PLACES=188, PETRI_TRANSITIONS=185} [2022-09-20 22:28:45,952 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 42 predicate places. [2022-09-20 22:28:45,952 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 185 transitions, 1326 flow [2022-09-20 22:28:45,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.0) internal successors, (763), 7 states have internal predecessors, (763), 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-09-20 22:28:45,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:45,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:45,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:28:45,953 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:45,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1874513182, now seen corresponding path program 1 times [2022-09-20 22:28:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:45,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933459237] [2022-09-20 22:28:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:46,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:46,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:46,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933459237] [2022-09-20 22:28:46,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933459237] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:46,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:46,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:28:46,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314481024] [2022-09-20 22:28:46,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:46,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:28:46,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:46,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:28:46,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:28:46,031 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-09-20 22:28:46,032 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 185 transitions, 1326 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-09-20 22:28:46,032 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:46,032 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-09-20 22:28:46,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:28:54,606 INFO L130 PetriNetUnfolder]: 27393/49350 cut-off events. [2022-09-20 22:28:54,606 INFO L131 PetriNetUnfolder]: For 138610/153837 co-relation queries the response was YES. [2022-09-20 22:28:55,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162395 conditions, 49350 events. 27393/49350 cut-off events. For 138610/153837 co-relation queries the response was YES. Maximal size of possible extension queue 3294. Compared 495850 event pairs, 1543 based on Foata normal form. 2229/49755 useless extension candidates. Maximal degree in co-relation 162280. Up to 10445 conditions per place. [2022-09-20 22:28:55,444 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 138 selfloop transitions, 38 changer transitions 0/314 dead transitions. [2022-09-20 22:28:55,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 314 transitions, 2560 flow [2022-09-20 22:28:55,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:28:55,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:28:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1600 transitions. [2022-09-20 22:28:55,448 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8854454897620365 [2022-09-20 22:28:55,448 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1600 transitions. [2022-09-20 22:28:55,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1600 transitions. [2022-09-20 22:28:55,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:28:55,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1600 transitions. [2022-09-20 22:28:55,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 123.07692307692308) internal successors, (1600), 13 states have internal predecessors, (1600), 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-09-20 22:28:55,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:55,454 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 139.0) internal successors, (1946), 14 states have internal predecessors, (1946), 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-09-20 22:28:55,455 INFO L175 Difference]: Start difference. First operand has 188 places, 185 transitions, 1326 flow. Second operand 13 states and 1600 transitions. [2022-09-20 22:28:55,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 314 transitions, 2560 flow [2022-09-20 22:28:57,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 314 transitions, 2506 flow, removed 27 selfloop flow, removed 1 redundant places. [2022-09-20 22:28:57,069 INFO L231 Difference]: Finished difference. Result has 205 places, 202 transitions, 1517 flow [2022-09-20 22:28:57,069 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1517, PETRI_PLACES=205, PETRI_TRANSITIONS=202} [2022-09-20 22:28:57,070 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 59 predicate places. [2022-09-20 22:28:57,070 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 202 transitions, 1517 flow [2022-09-20 22:28:57,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 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-09-20 22:28:57,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:28:57,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:28:57,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:28:57,070 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:28:57,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:28:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1120690190, now seen corresponding path program 1 times [2022-09-20 22:28:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:28:57,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238936766] [2022-09-20 22:28:57,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:28:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:28:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:28:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:28:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:28:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238936766] [2022-09-20 22:28:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238936766] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:28:57,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:28:57,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:28:57,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041361971] [2022-09-20 22:28:57,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:28:57,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:28:57,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:28:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:28:57,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:28:57,203 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-09-20 22:28:57,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 202 transitions, 1517 flow. Second operand has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 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-09-20 22:28:57,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:28:57,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-09-20 22:28:57,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:06,515 INFO L130 PetriNetUnfolder]: 26443/47831 cut-off events. [2022-09-20 22:29:06,515 INFO L131 PetriNetUnfolder]: For 207593/222695 co-relation queries the response was YES. [2022-09-20 22:29:07,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187303 conditions, 47831 events. 26443/47831 cut-off events. For 207593/222695 co-relation queries the response was YES. Maximal size of possible extension queue 3289. Compared 485759 event pairs, 1414 based on Foata normal form. 1834/47868 useless extension candidates. Maximal degree in co-relation 187180. Up to 10102 conditions per place. [2022-09-20 22:29:07,548 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 131 selfloop transitions, 58 changer transitions 46/354 dead transitions. [2022-09-20 22:29:07,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 354 transitions, 3143 flow [2022-09-20 22:29:07,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:29:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:29:07,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1972 transitions. [2022-09-20 22:29:07,553 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8866906474820144 [2022-09-20 22:29:07,553 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1972 transitions. [2022-09-20 22:29:07,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1972 transitions. [2022-09-20 22:29:07,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:07,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1972 transitions. [2022-09-20 22:29:07,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 123.25) internal successors, (1972), 16 states have internal predecessors, (1972), 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-09-20 22:29:07,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 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-09-20 22:29:07,560 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 139.0) internal successors, (2363), 17 states have internal predecessors, (2363), 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-09-20 22:29:07,560 INFO L175 Difference]: Start difference. First operand has 205 places, 202 transitions, 1517 flow. Second operand 16 states and 1972 transitions. [2022-09-20 22:29:07,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 354 transitions, 3143 flow [2022-09-20 22:29:18,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 354 transitions, 3020 flow, removed 52 selfloop flow, removed 4 redundant places. [2022-09-20 22:29:18,403 INFO L231 Difference]: Finished difference. Result has 217 places, 209 transitions, 1621 flow [2022-09-20 22:29:18,403 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1621, PETRI_PLACES=217, PETRI_TRANSITIONS=209} [2022-09-20 22:29:18,404 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 71 predicate places. [2022-09-20 22:29:18,404 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 209 transitions, 1621 flow [2022-09-20 22:29:18,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.125) internal successors, (913), 8 states have internal predecessors, (913), 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-09-20 22:29:18,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:18,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:29:18,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:29:18,405 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:18,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:18,405 INFO L85 PathProgramCache]: Analyzing trace with hash 471946075, now seen corresponding path program 1 times [2022-09-20 22:29:18,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:18,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830268284] [2022-09-20 22:29:18,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:18,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:18,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830268284] [2022-09-20 22:29:18,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830268284] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:18,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:18,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 22:29:18,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624619900] [2022-09-20 22:29:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:18,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:29:18,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:29:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:29:18,595 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 139 [2022-09-20 22:29:18,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 209 transitions, 1621 flow. Second operand has 10 states, 10 states have (on average 112.3) internal successors, (1123), 10 states have internal predecessors, (1123), 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-09-20 22:29:18,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:18,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 139 [2022-09-20 22:29:18,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:23,363 INFO L130 PetriNetUnfolder]: 8701/28829 cut-off events. [2022-09-20 22:29:23,363 INFO L131 PetriNetUnfolder]: For 144250/152339 co-relation queries the response was YES. [2022-09-20 22:29:23,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109088 conditions, 28829 events. 8701/28829 cut-off events. For 144250/152339 co-relation queries the response was YES. Maximal size of possible extension queue 3480. Compared 432631 event pairs, 289 based on Foata normal form. 30/27193 useless extension candidates. Maximal degree in co-relation 108954. Up to 6512 conditions per place. [2022-09-20 22:29:24,037 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 47 selfloop transitions, 18 changer transitions 14/261 dead transitions. [2022-09-20 22:29:24,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 261 transitions, 2055 flow [2022-09-20 22:29:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:29:24,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:29:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1172 transitions. [2022-09-20 22:29:24,041 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8431654676258993 [2022-09-20 22:29:24,041 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1172 transitions. [2022-09-20 22:29:24,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1172 transitions. [2022-09-20 22:29:24,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:24,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1172 transitions. [2022-09-20 22:29:24,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.2) internal successors, (1172), 10 states have internal predecessors, (1172), 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-09-20 22:29:24,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 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-09-20 22:29:24,045 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 139.0) internal successors, (1529), 11 states have internal predecessors, (1529), 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-09-20 22:29:24,045 INFO L175 Difference]: Start difference. First operand has 217 places, 209 transitions, 1621 flow. Second operand 10 states and 1172 transitions. [2022-09-20 22:29:24,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 261 transitions, 2055 flow [2022-09-20 22:29:36,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 261 transitions, 1652 flow, removed 159 selfloop flow, removed 22 redundant places. [2022-09-20 22:29:36,665 INFO L231 Difference]: Finished difference. Result has 205 places, 227 transitions, 1469 flow [2022-09-20 22:29:36,665 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1262, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1469, PETRI_PLACES=205, PETRI_TRANSITIONS=227} [2022-09-20 22:29:36,668 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 59 predicate places. [2022-09-20 22:29:36,668 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 227 transitions, 1469 flow [2022-09-20 22:29:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.3) internal successors, (1123), 10 states have internal predecessors, (1123), 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-09-20 22:29:36,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:36,668 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:29:36,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:29:36,669 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -28838847, now seen corresponding path program 2 times [2022-09-20 22:29:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:36,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094974463] [2022-09-20 22:29:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:36,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:36,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:36,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094974463] [2022-09-20 22:29:36,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094974463] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:36,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:36,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:29:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016180763] [2022-09-20 22:29:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:36,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:29:36,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:29:36,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:29:36,788 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 139 [2022-09-20 22:29:36,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 227 transitions, 1469 flow. Second operand has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 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-09-20 22:29:36,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:36,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 139 [2022-09-20 22:29:36,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:54,187 INFO L130 PetriNetUnfolder]: 47487/88096 cut-off events. [2022-09-20 22:29:54,188 INFO L131 PetriNetUnfolder]: For 215969/239897 co-relation queries the response was YES. [2022-09-20 22:29:55,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 303033 conditions, 88096 events. 47487/88096 cut-off events. For 215969/239897 co-relation queries the response was YES. Maximal size of possible extension queue 5881. Compared 996893 event pairs, 1120 based on Foata normal form. 2344/88195 useless extension candidates. Maximal degree in co-relation 302990. Up to 11530 conditions per place. [2022-09-20 22:29:55,759 INFO L137 encePairwiseOnDemand]: 128/139 looper letters, 179 selfloop transitions, 63 changer transitions 148/509 dead transitions. [2022-09-20 22:29:55,759 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 509 transitions, 4749 flow [2022-09-20 22:29:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 22:29:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 22:29:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2293 transitions. [2022-09-20 22:29:55,763 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8682317304051496 [2022-09-20 22:29:55,763 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2293 transitions. [2022-09-20 22:29:55,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2293 transitions. [2022-09-20 22:29:55,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:55,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2293 transitions. [2022-09-20 22:29:55,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 120.6842105263158) internal successors, (2293), 19 states have internal predecessors, (2293), 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-09-20 22:29:55,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 139.0) internal successors, (2780), 20 states have internal predecessors, (2780), 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-09-20 22:29:55,772 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 139.0) internal successors, (2780), 20 states have internal predecessors, (2780), 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-09-20 22:29:55,772 INFO L175 Difference]: Start difference. First operand has 205 places, 227 transitions, 1469 flow. Second operand 19 states and 2293 transitions. [2022-09-20 22:29:55,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 509 transitions, 4749 flow [2022-09-20 22:30:17,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 509 transitions, 4661 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-09-20 22:30:17,724 INFO L231 Difference]: Finished difference. Result has 218 places, 218 transitions, 1529 flow [2022-09-20 22:30:17,725 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=139, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1529, PETRI_PLACES=218, PETRI_TRANSITIONS=218} [2022-09-20 22:30:17,725 INFO L287 CegarLoopForPetriNet]: 146 programPoint places, 72 predicate places. [2022-09-20 22:30:17,725 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 218 transitions, 1529 flow [2022-09-20 22:30:17,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 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-09-20 22:30:17,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:30:17,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 22:30:17,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:30:17,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:30:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:30:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash 2081775469, now seen corresponding path program 1 times [2022-09-20 22:30:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:30:17,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617556834] [2022-09-20 22:30:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:30:17,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:30:17,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:30:17,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:30:17,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:30:17,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617556834] [2022-09-20 22:30:17,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617556834] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:30:17,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:30:17,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:30:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858662226] [2022-09-20 22:30:17,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:30:17,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:30:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:30:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:30:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:30:17,855 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 139 [2022-09-20 22:30:17,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 218 transitions, 1529 flow. Second operand has 8 states, 8 states have (on average 107.75) internal successors, (862), 8 states have internal predecessors, (862), 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-09-20 22:30:17,866 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:30:17,866 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 139 [2022-09-20 22:30:17,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand