./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 12:37:20,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 12:37:20,482 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 12:37:20,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 12:37:20,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 12:37:20,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 12:37:20,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 12:37:20,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 12:37:20,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 12:37:20,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 12:37:20,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 12:37:20,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 12:37:20,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 12:37:20,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 12:37:20,519 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 12:37:20,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 12:37:20,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 12:37:20,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 12:37:20,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 12:37:20,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 12:37:20,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 12:37:20,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 12:37:20,526 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 12:37:20,526 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 12:37:20,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 12:37:20,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 12:37:20,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 12:37:20,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 12:37:20,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 12:37:20,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 12:37:20,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 12:37:20,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 12:37:20,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:37:20,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 12:37:20,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 12:37:20,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 12:37:20,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 12:37:20,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 12:37:20,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 12:37:20,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 12:37:20,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 12:37:20,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 12:37:20,532 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2024-10-24 12:37:20,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 12:37:20,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 12:37:20,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 12:37:20,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 12:37:20,801 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 12:37:20,802 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-10-24 12:37:22,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 12:37:22,451 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 12:37:22,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2024-10-24 12:37:22,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935f5e696/785a72cc5ff046c58f1d188723f1a306/FLAG981ffde31 [2024-10-24 12:37:22,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935f5e696/785a72cc5ff046c58f1d188723f1a306 [2024-10-24 12:37:22,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 12:37:22,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 12:37:22,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 12:37:22,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 12:37:22,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 12:37:22,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc089f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22, skipping insertion in model container [2024-10-24 12:37:22,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 12:37:22,763 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2024-10-24 12:37:22,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:37:22,783 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 12:37:22,817 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c[2996,3009] [2024-10-24 12:37:22,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 12:37:22,838 INFO L204 MainTranslator]: Completed translation [2024-10-24 12:37:22,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22 WrapperNode [2024-10-24 12:37:22,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 12:37:22,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 12:37:22,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 12:37:22,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 12:37:22,848 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,891 INFO L138 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2024-10-24 12:37:22,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 12:37:22,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 12:37:22,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 12:37:22,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 12:37:22,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,933 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,954 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 12:37:22,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,989 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:22,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 12:37:22,995 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 12:37:22,995 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 12:37:22,995 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 12:37:22,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (1/1) ... [2024-10-24 12:37:23,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 12:37:23,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:37:23,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 12:37:23,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 12:37:23,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 12:37:23,087 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-24 12:37:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-24 12:37:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-24 12:37:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-24 12:37:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-24 12:37:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-24 12:37:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 12:37:23,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-24 12:37:23,090 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-24 12:37:23,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 12:37:23,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 12:37:23,093 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-24 12:37:23,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 12:37:23,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 12:37:23,450 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-24 12:37:23,452 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 12:37:23,649 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 12:37:23,649 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-24 12:37:23,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:37:23 BoogieIcfgContainer [2024-10-24 12:37:23,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 12:37:23,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 12:37:23,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 12:37:23,659 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 12:37:23,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:37:22" (1/3) ... [2024-10-24 12:37:23,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edbda33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:37:23, skipping insertion in model container [2024-10-24 12:37:23,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:37:22" (2/3) ... [2024-10-24 12:37:23,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@edbda33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:37:23, skipping insertion in model container [2024-10-24 12:37:23,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:37:23" (3/3) ... [2024-10-24 12:37:23,662 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2024-10-24 12:37:23,676 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 12:37:23,676 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 12:37:23,676 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-24 12:37:23,732 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-24 12:37:23,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 35 transitions, 91 flow [2024-10-24 12:37:23,808 INFO L124 PetriNetUnfolderBase]: 3/32 cut-off events. [2024-10-24 12:37:23,808 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 12:37:23,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2024-10-24 12:37:23,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 35 transitions, 91 flow [2024-10-24 12:37:23,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 31 transitions, 80 flow [2024-10-24 12:37:23,826 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 12:37:23,839 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@4d5178af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 12:37:23,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-24 12:37:23,862 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-24 12:37:23,862 INFO L124 PetriNetUnfolderBase]: 3/30 cut-off events. [2024-10-24 12:37:23,862 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-24 12:37:23,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:23,866 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 12:37:23,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:37:23,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1029020577, now seen corresponding path program 1 times [2024-10-24 12:37:23,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:23,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939105687] [2024-10-24 12:37:23,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:23,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:24,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:24,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:24,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939105687] [2024-10-24 12:37:24,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939105687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:37:24,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:37:24,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:37:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311492521] [2024-10-24 12:37:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:37:24,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:37:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:24,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:37:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:37:24,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-24 12:37:24,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2024-10-24 12:37:24,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:24,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-24 12:37:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:37:25,093 INFO L124 PetriNetUnfolderBase]: 367/655 cut-off events. [2024-10-24 12:37:25,095 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-24 12:37:25,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1264 conditions, 655 events. 367/655 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3347 event pairs, 26 based on Foata normal form. 20/660 useless extension candidates. Maximal degree in co-relation 1074. Up to 445 conditions per place. [2024-10-24 12:37:25,113 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 33 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-10-24 12:37:25,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 49 transitions, 204 flow [2024-10-24 12:37:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 12:37:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-24 12:37:25,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-10-24 12:37:25,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6785714285714286 [2024-10-24 12:37:25,130 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 80 flow. Second operand 4 states and 95 transitions. [2024-10-24 12:37:25,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 49 transitions, 204 flow [2024-10-24 12:37:25,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-24 12:37:25,138 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-10-24 12:37:25,141 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-10-24 12:37:25,146 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, -1 predicate places. [2024-10-24 12:37:25,147 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-10-24 12:37:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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) [2024-10-24 12:37:25,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:25,149 INFO L204 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] [2024-10-24 12:37:25,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 12:37:25,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:37:25,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 631285081, now seen corresponding path program 1 times [2024-10-24 12:37:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611610758] [2024-10-24 12:37:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:25,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:25,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:25,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611610758] [2024-10-24 12:37:25,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611610758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:37:25,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:37:25,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 12:37:25,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199448640] [2024-10-24 12:37:25,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:37:25,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:37:25,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:25,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:37:25,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:37:25,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2024-10-24 12:37:25,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2024-10-24 12:37:25,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:25,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2024-10-24 12:37:25,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:37:26,084 INFO L124 PetriNetUnfolderBase]: 1042/1669 cut-off events. [2024-10-24 12:37:26,084 INFO L125 PetriNetUnfolderBase]: For 412/448 co-relation queries the response was YES. [2024-10-24 12:37:26,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 1669 events. 1042/1669 cut-off events. For 412/448 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8714 event pairs, 288 based on Foata normal form. 24/1665 useless extension candidates. Maximal degree in co-relation 2474. Up to 925 conditions per place. [2024-10-24 12:37:26,096 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 59 selfloop transitions, 20 changer transitions 0/87 dead transitions. [2024-10-24 12:37:26,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 87 transitions, 422 flow [2024-10-24 12:37:26,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:37:26,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:37:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-10-24 12:37:26,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6971428571428572 [2024-10-24 12:37:26,098 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 5 states and 122 transitions. [2024-10-24 12:37:26,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 87 transitions, 422 flow [2024-10-24 12:37:26,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-24 12:37:26,101 INFO L231 Difference]: Finished difference. Result has 44 places, 53 transitions, 256 flow [2024-10-24 12:37:26,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=44, PETRI_TRANSITIONS=53} [2024-10-24 12:37:26,102 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2024-10-24 12:37:26,103 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 53 transitions, 256 flow [2024-10-24 12:37:26,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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) [2024-10-24 12:37:26,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:26,103 INFO L204 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] [2024-10-24 12:37:26,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 12:37:26,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:37:26,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:26,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1270762887, now seen corresponding path program 2 times [2024-10-24 12:37:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:26,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029050478] [2024-10-24 12:37:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:26,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:26,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029050478] [2024-10-24 12:37:26,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029050478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:37:26,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779189891] [2024-10-24 12:37:26,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 12:37:26,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:37:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:37:26,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:37:26,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 12:37:26,480 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 12:37:26,483 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:37:26,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 12:37:26,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:37:26,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:37:26,596 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 12:37:26,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779189891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:37:26,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 12:37:26,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-10-24 12:37:26,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586103425] [2024-10-24 12:37:26,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:37:26,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:37:26,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:26,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:37:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 12:37:26,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-24 12:37:26,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 53 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-10-24 12:37:26,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:26,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-24 12:37:26,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:37:26,847 INFO L124 PetriNetUnfolderBase]: 785/1286 cut-off events. [2024-10-24 12:37:26,848 INFO L125 PetriNetUnfolderBase]: For 1097/1197 co-relation queries the response was YES. [2024-10-24 12:37:26,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3769 conditions, 1286 events. 785/1286 cut-off events. For 1097/1197 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 6385 event pairs, 87 based on Foata normal form. 114/1368 useless extension candidates. Maximal degree in co-relation 3033. Up to 623 conditions per place. [2024-10-24 12:37:26,859 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 61 selfloop transitions, 6 changer transitions 2/83 dead transitions. [2024-10-24 12:37:26,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 510 flow [2024-10-24 12:37:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:37:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:37:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-10-24 12:37:26,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.68 [2024-10-24 12:37:26,862 INFO L175 Difference]: Start difference. First operand has 44 places, 53 transitions, 256 flow. Second operand 5 states and 119 transitions. [2024-10-24 12:37:26,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 510 flow [2024-10-24 12:37:26,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 83 transitions, 502 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-10-24 12:37:26,868 INFO L231 Difference]: Finished difference. Result has 51 places, 54 transitions, 274 flow [2024-10-24 12:37:26,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=51, PETRI_TRANSITIONS=54} [2024-10-24 12:37:26,869 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2024-10-24 12:37:26,869 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 54 transitions, 274 flow [2024-10-24 12:37:26,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-10-24 12:37:26,870 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:26,870 INFO L204 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] [2024-10-24 12:37:26,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 12:37:27,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:37:27,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:37:27,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:27,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1180905068, now seen corresponding path program 1 times [2024-10-24 12:37:27,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:27,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877299569] [2024-10-24 12:37:27,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:27,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:27,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:27,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877299569] [2024-10-24 12:37:27,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877299569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:37:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:37:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 12:37:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265787747] [2024-10-24 12:37:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:37:27,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 12:37:27,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 12:37:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 12:37:27,359 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-24 12:37:27,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 54 transitions, 274 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) [2024-10-24 12:37:27,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:27,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-24 12:37:27,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:37:27,633 INFO L124 PetriNetUnfolderBase]: 1074/1766 cut-off events. [2024-10-24 12:37:27,633 INFO L125 PetriNetUnfolderBase]: For 2464/2569 co-relation queries the response was YES. [2024-10-24 12:37:27,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5664 conditions, 1766 events. 1074/1766 cut-off events. For 2464/2569 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 9813 event pairs, 180 based on Foata normal form. 141/1877 useless extension candidates. Maximal degree in co-relation 3923. Up to 1036 conditions per place. [2024-10-24 12:37:27,648 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 63 selfloop transitions, 10 changer transitions 0/86 dead transitions. [2024-10-24 12:37:27,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 86 transitions, 570 flow [2024-10-24 12:37:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:37:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:37:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2024-10-24 12:37:27,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2024-10-24 12:37:27,650 INFO L175 Difference]: Start difference. First operand has 51 places, 54 transitions, 274 flow. Second operand 5 states and 116 transitions. [2024-10-24 12:37:27,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 86 transitions, 570 flow [2024-10-24 12:37:27,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 86 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-24 12:37:27,661 INFO L231 Difference]: Finished difference. Result has 55 places, 56 transitions, 313 flow [2024-10-24 12:37:27,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=56} [2024-10-24 12:37:27,663 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2024-10-24 12:37:27,664 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 56 transitions, 313 flow [2024-10-24 12:37:27,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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) [2024-10-24 12:37:27,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:27,664 INFO L204 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] [2024-10-24 12:37:27,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 12:37:27,665 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:37:27,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:27,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1706424632, now seen corresponding path program 2 times [2024-10-24 12:37:27,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:27,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388843062] [2024-10-24 12:37:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:27,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 12:37:27,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:27,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388843062] [2024-10-24 12:37:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388843062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 12:37:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 12:37:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 12:37:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263686858] [2024-10-24 12:37:27,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 12:37:27,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 12:37:27,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:27,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 12:37:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 12:37:27,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2024-10-24 12:37:27,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 56 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-10-24 12:37:27,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:27,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2024-10-24 12:37:27,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:37:28,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([306] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][41], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 33#L112-4true, 14#thread1EXITtrue, 145#true, 53#true, 153#true, Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), 10#thread2EXITtrue, Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 35#L85true, 45#true, Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-10-24 12:37:28,221 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2024-10-24 12:37:28,221 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:37:28,221 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:37:28,221 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:37:28,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][55], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 33#L112-4true, 14#thread1EXITtrue, 145#true, 53#true, 153#true, Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 35#L85true, 21#L69true, 45#true, Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-10-24 12:37:28,221 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,222 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,222 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,222 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([306] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][41], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 14#thread1EXITtrue, 145#true, 53#true, 153#true, Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), 10#thread2EXITtrue, Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L85true, Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 11#L113true, 45#true, Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-10-24 12:37:28,242 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,242 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,242 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,242 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-10-24 12:37:28,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][55], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 14#thread1EXITtrue, 145#true, 53#true, 153#true, Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 35#L85true, 21#L69true, 11#L113true, 45#true, Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-10-24 12:37:28,243 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,243 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,243 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,243 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([306] L72-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork2_#res.offset_1| 0) (= |v_thread2Thread1of1ForFork2_#res.base_1| 0) (= (mod v_thread2Thread1of1ForFork2_~cond~1_5 256) 0)) InVars {thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5} OutVars{thread2Thread1of1ForFork2_#res.base=|v_thread2Thread1of1ForFork2_#res.base_1|, thread2Thread1of1ForFork2_~cond~1=v_thread2Thread1of1ForFork2_~cond~1_5, thread2Thread1of1ForFork2_#res.offset=|v_thread2Thread1of1ForFork2_#res.offset_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res.base, thread2Thread1of1ForFork2_#res.offset][41], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 20#L113-1true, 145#true, 53#true, 153#true, Black: 72#(<= 1 (mod ~u~0 4294967296)), 10#thread2EXITtrue, Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), 35#L85true, Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 45#true, Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-10-24 12:37:28,257 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,257 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,257 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,257 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-10-24 12:37:28,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([307] L64-->L69: Formula: (let ((.cse0 (mod v_~t~0_76 4294967296))) (or (and (= v_~t~0_76 v_~t~0_75) (= |v_thread2Thread1of1ForFork2_#t~post4_2| |v_thread2Thread1of1ForFork2_#t~post4_1|) (<= .cse0 0) (= |v_thread2Thread1of1ForFork2_#t~post3_2| |v_thread2Thread1of1ForFork2_#t~post3_1|) (= v_~s~0_77 v_~s~0_78)) (and (= v_~s~0_77 (+ v_~s~0_78 1)) (< 0 .cse0) (= v_~t~0_76 (+ v_~t~0_75 1))))) InVars {thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_1|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_1|, ~t~0=v_~t~0_76, ~s~0=v_~s~0_78} OutVars{thread2Thread1of1ForFork2_#t~post3=|v_thread2Thread1of1ForFork2_#t~post3_2|, thread2Thread1of1ForFork2_#t~post4=|v_thread2Thread1of1ForFork2_#t~post4_2|, ~t~0=v_~t~0_75, ~s~0=v_~s~0_77} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post3, thread2Thread1of1ForFork2_#t~post4, ~t~0, ~s~0][55], [Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 20#L113-1true, 145#true, 53#true, 153#true, Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), 35#L85true, 21#L69true, 45#true, Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0))]) [2024-10-24 12:37:28,258 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:37:28,258 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:37:28,258 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:37:28,258 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-10-24 12:37:28,273 INFO L124 PetriNetUnfolderBase]: 1720/2759 cut-off events. [2024-10-24 12:37:28,274 INFO L125 PetriNetUnfolderBase]: For 4341/4543 co-relation queries the response was YES. [2024-10-24 12:37:28,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 2759 events. 1720/2759 cut-off events. For 4341/4543 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15920 event pairs, 145 based on Foata normal form. 136/2844 useless extension candidates. Maximal degree in co-relation 4958. Up to 1555 conditions per place. [2024-10-24 12:37:28,299 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 81 selfloop transitions, 12 changer transitions 0/109 dead transitions. [2024-10-24 12:37:28,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 804 flow [2024-10-24 12:37:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 12:37:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-24 12:37:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-10-24 12:37:28,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.72 [2024-10-24 12:37:28,301 INFO L175 Difference]: Start difference. First operand has 55 places, 56 transitions, 313 flow. Second operand 5 states and 126 transitions. [2024-10-24 12:37:28,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 804 flow [2024-10-24 12:37:28,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 778 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-24 12:37:28,317 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 447 flow [2024-10-24 12:37:28,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=447, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2024-10-24 12:37:28,318 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2024-10-24 12:37:28,319 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 447 flow [2024-10-24 12:37:28,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) [2024-10-24 12:37:28,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:37:28,320 INFO L204 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] [2024-10-24 12:37:28,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 12:37:28,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:37:28,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:37:28,321 INFO L85 PathProgramCache]: Analyzing trace with hash 876781812, now seen corresponding path program 1 times [2024-10-24 12:37:28,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:37:28,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039105110] [2024-10-24 12:37:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:37:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:31,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:31,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:37:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039105110] [2024-10-24 12:37:31,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039105110] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:37:31,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886115550] [2024-10-24 12:37:31,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:37:31,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:37:31,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:37:31,006 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:37:31,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 12:37:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:37:31,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 12:37:31,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:37:32,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:32,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:37:46,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:37:46,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886115550] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:37:46,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:37:46,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2024-10-24 12:37:46,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748536045] [2024-10-24 12:37:46,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:37:46,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-24 12:37:46,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:37:46,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-24 12:37:46,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2024-10-24 12:37:46,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2024-10-24 12:37:46,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 447 flow. Second operand has 27 states, 27 states have (on average 10.222222222222221) internal successors, (276), 27 states have internal predecessors, (276), 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) [2024-10-24 12:37:46,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:37:46,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2024-10-24 12:37:46,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:38:10,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 12:38:27,356 INFO L124 PetriNetUnfolderBase]: 26910/39556 cut-off events. [2024-10-24 12:38:27,356 INFO L125 PetriNetUnfolderBase]: For 89814/89826 co-relation queries the response was YES. [2024-10-24 12:38:27,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140455 conditions, 39556 events. 26910/39556 cut-off events. For 89814/89826 co-relation queries the response was YES. Maximal size of possible extension queue 1779. Compared 272923 event pairs, 549 based on Foata normal form. 81/39636 useless extension candidates. Maximal degree in co-relation 59144. Up to 7518 conditions per place. [2024-10-24 12:38:27,711 INFO L140 encePairwiseOnDemand]: 19/35 looper letters, 553 selfloop transitions, 457 changer transitions 324/1339 dead transitions. [2024-10-24 12:38:27,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 1339 transitions, 10386 flow [2024-10-24 12:38:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2024-10-24 12:38:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2024-10-24 12:38:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 1858 transitions. [2024-10-24 12:38:27,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5256011315417256 [2024-10-24 12:38:27,722 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 447 flow. Second operand 101 states and 1858 transitions. [2024-10-24 12:38:27,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 1339 transitions, 10386 flow [2024-10-24 12:38:27,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 1339 transitions, 10332 flow, removed 7 selfloop flow, removed 1 redundant places. [2024-10-24 12:38:27,885 INFO L231 Difference]: Finished difference. Result has 215 places, 559 transitions, 6162 flow [2024-10-24 12:38:27,886 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=101, PETRI_FLOW=6162, PETRI_PLACES=215, PETRI_TRANSITIONS=559} [2024-10-24 12:38:27,886 INFO L277 CegarLoopForPetriNet]: 38 programPoint places, 177 predicate places. [2024-10-24 12:38:27,887 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 559 transitions, 6162 flow [2024-10-24 12:38:27,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.222222222222221) internal successors, (276), 27 states have internal predecessors, (276), 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) [2024-10-24 12:38:27,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-24 12:38:27,889 INFO L204 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] [2024-10-24 12:38:27,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 12:38:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 12:38:28,094 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-24 12:38:28,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 12:38:28,095 INFO L85 PathProgramCache]: Analyzing trace with hash -239063046, now seen corresponding path program 2 times [2024-10-24 12:38:28,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 12:38:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104334404] [2024-10-24 12:38:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 12:38:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 12:38:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 12:38:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:38:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 12:38:28,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104334404] [2024-10-24 12:38:28,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104334404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 12:38:28,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642918448] [2024-10-24 12:38:28,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 12:38:28,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 12:38:28,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 12:38:28,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 12:38:28,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 12:38:28,478 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 12:38:28,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 12:38:28,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 12:38:28,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 12:38:28,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:38:28,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 12:38:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 12:38:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642918448] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 12:38:28,635 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 12:38:28,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-24 12:38:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394016131] [2024-10-24 12:38:28,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 12:38:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 12:38:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 12:38:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 12:38:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-24 12:38:28,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 35 [2024-10-24 12:38:28,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 559 transitions, 6162 flow. Second operand has 10 states, 10 states have (on average 14.4) internal successors, (144), 10 states have internal predecessors, (144), 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) [2024-10-24 12:38:28,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-24 12:38:28,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 35 [2024-10-24 12:38:28,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-24 12:38:34,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L83-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][314], [Black: 164#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 492#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= 1 (mod ~S~0 4294967296))), Black: 470#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 284#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 514#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 450#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 416#(and (<= 1 (mod ~T~0 4294967296)) (= (+ ~u~0 1) ~U~0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (<= 1 (mod ~U~0 4294967296)) (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod ~u~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 (mod ~S~0 4294967296))), Black: 356#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 502#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 476#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 326#(or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 378#(and (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (and (or (and (or (and (<= (+ ~U~0 ~S~0 (mod ~T~0 4294967296)) (+ ~u~0 ~s~0 ~m~0 4294967296)) (or (< (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (and (<= (div ~m~0 4294967296) 0) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (+ (mod ~U~0 4294967296) 2 ~T~0 (mod ~S~0 4294967296)) (+ (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) ~t~0))))) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296))) (<= (mod ~m~0 4294967296) (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0)))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 428#(and (= (+ ~u~0 1) ~U~0) (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 462#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)))), Black: 362#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 510#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 364#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= thread3Thread1of1ForFork0_~cond~2 1) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 466#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 500#(and (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 45#true, Black: 241#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 518#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 360#(and (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 436#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))), Black: 156#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 456#(and (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 155#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 376#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= (+ ~T~0 1) ~t~0) (= ~s~0 ~S~0) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (= ~m~0 0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 426#(and (<= 1 (mod ~T~0 4294967296)) (= (+ ~u~0 1) ~U~0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod ~u~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 (mod ~S~0 4294967296))), Black: 158#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 498#(and (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0))) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 305#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 444#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 165#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 472#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 448#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 (mod ~U~0 4294967296)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= 1 (mod ~S~0 4294967296))), Black: 392#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 374#(and (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 446#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= 1 (mod ~S~0 4294967296))), 53#true, Black: 504#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 172#(= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)), Black: 162#true, Black: 478#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 434#(and (= (+ ~u~0 1) ~U~0) (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 10#thread2EXITtrue, Black: 422#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296))), Black: 454#(and (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 171#(or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 508#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 295#(or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 496#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 203#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= (+ ~T~0 1) ~t~0) (= ~s~0 ~S~0) (= ~m~0 0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 460#(and (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)))), Black: 458#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 474#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 414#(and (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 404#(and (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))), Black: 482#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 309#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 402#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 313#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 388#(and (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (and (or (and (or (and (<= (+ ~U~0 ~S~0 (mod ~T~0 4294967296)) (+ ~u~0 ~s~0 ~m~0 4294967296)) (or (< (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (and (<= (div ~m~0 4294967296) 0) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (+ (mod ~U~0 4294967296) 2 ~T~0 (mod ~S~0 4294967296)) (+ (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) ~t~0))))) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296))) (<= (mod ~m~0 4294967296) (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0)))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 33#L112-4true, 618#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 34#L53true, 35#L85true]) [2024-10-24 12:38:34,850 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-10-24 12:38:34,850 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 12:38:34,850 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 12:38:34,850 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2024-10-24 12:38:36,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([313] L83-->L85: Formula: (= v_~t~0_41 (+ v_~t~0_42 1)) InVars {~t~0=v_~t~0_42} OutVars{thread3Thread1of1ForFork0_#t~post5=|v_thread3Thread1of1ForFork0_#t~post5_1|, ~t~0=v_~t~0_41} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~post5, ~t~0][314], [Black: 164#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 492#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= 1 (mod ~S~0 4294967296))), Black: 470#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 284#(or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))), Black: 514#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 450#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 416#(and (<= 1 (mod ~T~0 4294967296)) (= (+ ~u~0 1) ~U~0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (<= 1 (mod ~U~0 4294967296)) (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod ~u~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 (mod ~S~0 4294967296))), Black: 356#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 72#(<= 1 (mod ~u~0 4294967296)), Black: 502#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 124#(= thread1Thread1of1ForFork1_~cond~0 1), Black: 476#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 141#(and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~u~0 4294967296))), Black: 326#(or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 378#(and (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (and (or (and (or (and (<= (+ ~U~0 ~S~0 (mod ~T~0 4294967296)) (+ ~u~0 ~s~0 ~m~0 4294967296)) (or (< (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (and (<= (div ~m~0 4294967296) 0) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (+ (mod ~U~0 4294967296) 2 ~T~0 (mod ~S~0 4294967296)) (+ (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) ~t~0))))) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296))) (<= (mod ~m~0 4294967296) (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0)))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 428#(and (= (+ ~u~0 1) ~U~0) (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 462#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)))), Black: 362#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= thread3Thread1of1ForFork0_~cond~2 1) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 352#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 510#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 364#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= thread3Thread1of1ForFork0_~cond~2 1) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 149#(and (<= (div thread2Thread1of1ForFork2_~cond~1 256) 0) (<= 1 thread2Thread1of1ForFork2_~cond~1)), Black: 466#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 500#(and (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 45#true, Black: 241#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 518#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 360#(and (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 436#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))), Black: 456#(and (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 156#(and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 376#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= (+ ~T~0 1) ~t~0) (= ~s~0 ~S~0) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 0) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (= ~m~0 0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 155#(and (= ~s~0 ~S~0) (<= 1 (mod ~S~0 4294967296))), Black: 158#(and (= ~s~0 ~S~0) (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 (mod ~S~0 4294967296)) (<= 1 thread1Thread1of1ForFork1_~cond~0)), Black: 426#(and (<= 1 (mod ~T~0 4294967296)) (= (+ ~u~0 1) ~U~0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (or (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod ~u~0 4294967296)))) (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (<= 1 (mod ~S~0 4294967296))), Black: 498#(and (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0))) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 305#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 444#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 165#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= ~s~0 ~S~0) (= thread3Thread1of1ForFork0_~cond~2 1) (= ~m~0 0) (= ~t~0 ~T~0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 472#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296)))), Black: 448#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (<= 1 (mod ~U~0 4294967296)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= 1 (mod ~S~0 4294967296))), Black: 392#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 374#(and (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 53#true, Black: 446#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) 1)) (< 0 thread1Thread1of1ForFork1_~cond~0)) (<= 1 (mod ~S~0 4294967296))), Black: 504#(and (<= 1 (mod ~T~0 4294967296)) (or (and (or (< 0 (mod (+ 4294967295 ~S~0) 4294967296)) (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread1Thread1of1ForFork1_~cond~0 1)) (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0))) (= ~m~0 1) (or (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= 2 (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) 1) (< 0 (mod ~s~0 4294967296)))) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (and (<= (mod (+ ~T~0 1) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0)) (and (or (< 0 (mod (+ ~T~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~U~0) 4294967296))) (= thread2Thread1of1ForFork2_~cond~1 1))) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 172#(= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)), Black: 162#true, Black: 478#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 434#(and (= (+ ~u~0 1) ~U~0) (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (= ~m~0 1) (= ~S~0 (+ ~s~0 1)) (= (+ ~T~0 1) ~t~0) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), 10#thread2EXITtrue, Black: 422#(and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296))), Black: 454#(and (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0))) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)))) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), 171#(or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (and (<= (div thread1Thread1of1ForFork1_~cond~0 256) 0) (<= 1 thread1Thread1of1ForFork1_~cond~0))), Black: 508#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 295#(or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))), Black: 47#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0)), Black: 496#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread2Thread1of1ForFork2_~cond~1 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 50#(and (<= 1 (mod ~T~0 4294967296)) (= ~t~0 ~T~0) (= thread2Thread1of1ForFork2_~cond~1 1)), Black: 203#(and (<= 1 (mod ~T~0 4294967296)) (= ~u~0 ~U~0) (= (+ ~T~0 1) ~t~0) (= ~s~0 ~S~0) (= ~m~0 0) (<= 1 (mod ~U~0 4294967296)) (<= 1 (mod ~S~0 4294967296))), Black: 460#(and (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)))), Black: 458#(and (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), Black: 474#(and (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 414#(and (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256)))), 11#L113true, Black: 404#(and (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (< 0 (mod ~t~0 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))), Black: 482#(and (<= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296))) (<= (mod (+ ~T~0 1) 4294967296) 0) (= ~m~0 1) (<= (mod (+ 4294967295 ~S~0) 4294967296) 0) (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296))) (<= (mod (+ 4294967295 ~U~0) 4294967296) 0) (<= (div ~u~0 4294967296) (div ~U~0 4294967296)) (= thread1Thread1of1ForFork1_~cond~0 0)), Black: 309#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 402#(and (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296)))))), Black: 313#(or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod thread1Thread1of1ForFork1_~cond~0 256) 0) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), Black: 59#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296))))), Black: 61#(and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (or (and (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (<= 1 (mod ~s~0 4294967296)))) (= thread2Thread1of1ForFork2_~cond~1 0)), Black: 388#(and (or (< (+ ~U~0 ~T~0 (mod ~S~0 4294967296)) (+ ~u~0 ~t~0 4294967296)) (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296) 1))) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))) (or (< 0 (mod (+ ~t~0 1) 4294967296)) (< 0 (mod (+ 4294967295 ~u~0) 4294967296)) (and (or (< 0 (mod (+ 4294967295 ~s~0) 4294967296)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod (+ ~m~0 1) 4294967296))) (or (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod ~s~0 4294967296))))) (or (and (or (and (or (and (<= (+ ~U~0 ~S~0 (mod ~T~0 4294967296)) (+ ~u~0 ~s~0 ~m~0 4294967296)) (or (< (+ (div ~U~0 4294967296) (div ~s~0 4294967296) (div ~T~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296)) (and (<= (div ~m~0 4294967296) 0) (= (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296))) (<= (+ (mod ~U~0 4294967296) 2 ~T~0 (mod ~S~0 4294967296)) (+ (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) ~t~0))))) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296))) (<= (mod ~m~0 4294967296) (mod (+ ~U~0 ~T~0 ~S~0) 4294967296))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< (div (+ ~U~0 ~T~0 ~S~0) 4294967296) (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~u~0 4294967296) (div ~m~0 4294967296) 1)) (< ~U~0 (+ (mod ~U~0 4294967296) ~u~0 ~m~0)))) (< (+ (div ~S~0 4294967296) (div ~t~0 4294967296) (div ~U~0 4294967296)) (div (+ ~U~0 ~T~0 ~S~0) 4294967296))) (or (< 0 (mod thread2Thread1of1ForFork2_~cond~1 256)) (= (mod (+ ~U~0 ~T~0 ~S~0) 4294967296) (mod ~m~0 4294967296)) (< 0 (mod thread1Thread1of1ForFork1_~cond~0 256))) (<= (div ~u~0 4294967296) (div ~U~0 4294967296))), Black: 55#(or (and (<= (mod ~t~0 4294967296) 0) (<= (mod ~u~0 4294967296) 0) (<= (mod ~s~0 4294967296) 0) (= thread1Thread1of1ForFork1_~cond~0 0)) (and (= thread1Thread1of1ForFork1_~cond~0 1) (or (< 0 (mod ~t~0 4294967296)) (< 0 (mod ~u~0 4294967296)) (< 0 (mod ~s~0 4294967296))))), 618#(and (= thread3Thread1of1ForFork0_~cond~2 1) (<= 1 (mod ~u~0 4294967296))), 34#L53true, 35#L85true]) [2024-10-24 12:38:36,106 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2024-10-24 12:38:36,107 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:38:36,107 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:38:36,107 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-10-24 12:38:38,391 INFO L124 PetriNetUnfolderBase]: 31187/45057 cut-off events. [2024-10-24 12:38:38,392 INFO L125 PetriNetUnfolderBase]: For 1360326/1373199 co-relation queries the response was YES. [2024-10-24 12:38:39,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314026 conditions, 45057 events. 31187/45057 cut-off events. For 1360326/1373199 co-relation queries the response was YES. Maximal size of possible extension queue 2178. Compared 313464 event pairs, 1205 based on Foata normal form. 2265/45741 useless extension candidates. Maximal degree in co-relation 313749. Up to 11616 conditions per place. [2024-10-24 12:38:39,563 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 1099 selfloop transitions, 315 changer transitions 0/1526 dead transitions. [2024-10-24 12:38:39,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1526 transitions, 19861 flow [2024-10-24 12:38:39,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 12:38:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-24 12:38:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 226 transitions. [2024-10-24 12:38:39,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2024-10-24 12:38:39,566 INFO L175 Difference]: Start difference. First operand has 215 places, 559 transitions, 6162 flow. Second operand 12 states and 226 transitions. [2024-10-24 12:38:39,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 1526 transitions, 19861 flow